/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-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix014_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:41:49,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:41:49,988 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:41:50,033 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:41:50,034 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:41:50,044 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:41:50,045 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:41:50,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:41:50,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:41:50,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:41:50,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:41:50,054 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:41:50,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:41:50,059 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:41:50,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:41:50,062 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:41:50,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:41:50,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:41:50,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:41:50,073 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:41:50,074 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:41:50,076 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:41:50,077 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:41:50,078 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:41:50,083 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:41:50,083 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:41:50,084 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:41:50,086 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:41:50,087 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:41:50,088 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:41:50,088 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:41:50,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:41:50,089 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:41:50,091 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:41:50,092 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:41:50,092 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:41:50,093 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:41:50,093 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:41:50,093 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:41:50,094 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:41:50,095 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:41:50,096 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-SemanticLooper.epf [2020-10-16 04:41:50,139 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:41:50,139 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:41:50,140 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:41:50,141 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:41:50,141 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:41:50,141 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:41:50,141 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:41:50,141 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:41:50,141 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:41:50,142 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:41:50,143 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:41:50,143 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:41:50,143 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:41:50,143 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:41:50,144 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:41:50,144 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:41:50,144 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:41:50,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:41:50,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:41:50,144 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:41:50,145 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:41:50,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:41:50,145 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:41:50,145 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:41:50,145 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:41:50,146 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:41:50,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:41:50,146 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:41:50,146 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:41:50,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:41:50,425 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:41:50,429 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:41:50,430 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:41:50,431 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:41:50,431 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix014_tso.oepc.i [2020-10-16 04:41:50,491 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2212fa2d/b3bf67fbf64b4988a3584df6edeaf61a/FLAGaba353ada [2020-10-16 04:41:51,027 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:41:51,028 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix014_tso.oepc.i [2020-10-16 04:41:51,045 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2212fa2d/b3bf67fbf64b4988a3584df6edeaf61a/FLAGaba353ada [2020-10-16 04:41:51,323 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2212fa2d/b3bf67fbf64b4988a3584df6edeaf61a [2020-10-16 04:41:51,332 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:41:51,334 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:41:51,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:41:51,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:41:51,338 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:41:51,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:41:51" (1/1) ... [2020-10-16 04:41:51,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77674f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:41:51, skipping insertion in model container [2020-10-16 04:41:51,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:41:51" (1/1) ... [2020-10-16 04:41:51,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:41:51,408 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:41:51,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:41:51,960 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:41:52,032 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:41:52,104 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:41:52,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:41:52 WrapperNode [2020-10-16 04:41:52,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:41:52,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:41:52,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:41:52,106 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:41:52,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:41:52" (1/1) ... [2020-10-16 04:41:52,141 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:41:52" (1/1) ... [2020-10-16 04:41:52,186 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:41:52,186 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:41:52,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:41:52,187 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:41:52,196 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:41:52" (1/1) ... [2020-10-16 04:41:52,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:41:52" (1/1) ... [2020-10-16 04:41:52,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:41:52" (1/1) ... [2020-10-16 04:41:52,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:41:52" (1/1) ... [2020-10-16 04:41:52,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:41:52" (1/1) ... [2020-10-16 04:41:52,229 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:41:52" (1/1) ... [2020-10-16 04:41:52,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:41:52" (1/1) ... [2020-10-16 04:41:52,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:41:52,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:41:52,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:41:52,243 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:41:52,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:41:52" (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 04:41:52,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:41:52,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:41:52,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:41:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:41:52,332 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:41:52,332 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:41:52,333 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:41:52,334 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:41:52,334 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 04:41:52,335 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 04:41:52,337 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 04:41:52,338 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 04:41:52,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:41:52,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:41:52,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:41:52,341 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 04:41:56,584 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:41:56,585 INFO L298 CfgBuilder]: Removed 12 assume(true) statements. [2020-10-16 04:41:56,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:41:56 BoogieIcfgContainer [2020-10-16 04:41:56,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:41:56,589 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:41:56,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:41:56,593 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:41:56,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:41:51" (1/3) ... [2020-10-16 04:41:56,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a4c70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:41:56, skipping insertion in model container [2020-10-16 04:41:56,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:41:52" (2/3) ... [2020-10-16 04:41:56,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a4c70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:41:56, skipping insertion in model container [2020-10-16 04:41:56,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:41:56" (3/3) ... [2020-10-16 04:41:56,597 INFO L111 eAbstractionObserver]: Analyzing ICFG mix014_tso.oepc.i [2020-10-16 04:41:56,610 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:41:56,619 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2020-10-16 04:41:56,620 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:41:56,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,659 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,659 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,662 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,662 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,662 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,662 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,662 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,663 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,663 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,663 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,663 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,669 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,670 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,671 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,672 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,673 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,680 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,681 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,681 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,681 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,681 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,684 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,685 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,685 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,685 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,685 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,685 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,686 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,686 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,686 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,686 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,686 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,686 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,686 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,687 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,687 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,687 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,687 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,687 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,687 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,687 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,688 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,688 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,692 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,694 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,694 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,698 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,698 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,698 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,698 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,698 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,698 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,699 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,699 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,699 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,699 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,699 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,701 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,702 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,702 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,703 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,703 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,704 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,704 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,706 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,706 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,706 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~nondet31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,706 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,706 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,707 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,708 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,708 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,708 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,708 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,708 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,708 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,709 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,709 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,709 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,709 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,709 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,710 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,710 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,710 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,710 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,710 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,711 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,712 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,714 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:41:56,731 INFO L253 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2020-10-16 04:41:56,752 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:41:56,752 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:41:56,752 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:41:56,752 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:41:56,753 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:41:56,753 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:41:56,753 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:41:56,753 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:41:56,767 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 288 flow [2020-10-16 04:41:56,825 INFO L129 PetriNetUnfolder]: 2/130 cut-off events. [2020-10-16 04:41:56,825 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:41:56,830 INFO L80 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2020-10-16 04:41:56,830 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 134 transitions, 288 flow [2020-10-16 04:41:56,838 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 130 transitions, 272 flow [2020-10-16 04:41:56,840 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:41:56,842 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 130 transitions, 272 flow [2020-10-16 04:41:56,845 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 130 transitions, 272 flow [2020-10-16 04:41:56,846 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 272 flow [2020-10-16 04:41:56,878 INFO L129 PetriNetUnfolder]: 2/130 cut-off events. [2020-10-16 04:41:56,879 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:41:56,880 INFO L80 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2020-10-16 04:41:56,883 INFO L117 LiptonReduction]: Number of co-enabled transitions 2934 [2020-10-16 04:41:57,741 WARN L193 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 110 [2020-10-16 04:41:57,985 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-10-16 04:41:58,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:41:58,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:41:58,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:41:58,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:41:58,289 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:41:58,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:41:58,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:41:58,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:41:58,336 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:41:58,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:41:58,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:41:58,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:41:58,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:41:58,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:41:58,349 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:41:58,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:41:58,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:41:58,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:41:58,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:41:58,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:41:58,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:41:58,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:41:58,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:41:58,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:41:58,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:41:58,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:41:58,521 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 04:41:58,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:41:58,524 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 04:41:58,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:41:58,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:41:58,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:41:58,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:41:58,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:41:58,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:41:58,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:41:58,662 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:41:58,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:41:58,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:41:58,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:41:58,666 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:41:58,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:41:58,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:41:58,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:41:58,690 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:41:58,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:41:58,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:41:58,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:41:58,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:41:58,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:41:58,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 6, 3, 2, 1] term [2020-10-16 04:41:58,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:41:58,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 6, 1] term [2020-10-16 04:41:58,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:41:58,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-16 04:41:58,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:41:58,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-16 04:41:58,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:41:59,946 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 232 DAG size of output: 192 [2020-10-16 04:41:59,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 2, 2, 1] term [2020-10-16 04:41:59,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:41:59,951 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-16 04:41:59,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:00,879 WARN L193 SmtUtils]: Spent 909.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 131 [2020-10-16 04:42:01,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:01,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:01,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:01,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:01,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:01,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:01,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:01,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:01,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:01,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:01,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:01,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:01,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:01,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:01,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:01,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:01,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:01,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:01,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:01,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:01,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:01,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:01,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:01,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:01,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:01,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:01,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:01,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:01,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:01,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:01,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:01,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:01,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:01,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:01,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:01,418 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:01,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:01,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:01,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:01,449 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:01,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:01,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:01,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:01,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:01,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:01,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:01,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:01,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:42:01,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,669 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:42:01,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:42:01,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:42:01,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:01,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:01,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:42:01,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:01,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:42:01,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:01,710 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:42:01,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:01,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:42:01,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:01,713 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 04:42:01,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:01,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:42:01,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:01,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:01,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:42:01,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:01,777 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:42:01,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:01,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:42:01,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:01,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:42:01,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:01,781 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 04:42:01,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:01,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:42:01,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:01,824 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:42:01,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:42:01,826 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:42:01,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:01,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:42:01,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:42:01,876 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:42:01,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:01,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:42:01,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:01,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:42:01,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:01,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:42:01,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:01,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:42:01,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:01,923 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 04:42:01,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:01,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:42:01,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:01,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:01,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,968 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:01,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:01,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:01,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:01,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:01,977 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:01,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:01,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:01,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:02,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:02,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:02,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:02,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:02,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:02,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:02,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:02,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:02,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:02,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:02,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:02,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:02,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:02,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:02,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:02,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:02,205 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-16 04:42:02,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-16 04:42:02,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:02,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-16 04:42:02,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:02,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 3, 2, 1] term [2020-10-16 04:42:02,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:02,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 6, 1] term [2020-10-16 04:42:02,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:02,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:02,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:02,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:42:02,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:02,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:42:02,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:02,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:42:02,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:02,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:42:02,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:02,584 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 04:42:02,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:02,586 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 04:42:02,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:02,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:42:02,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:42:02,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:42:02,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:02,899 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-10-16 04:42:03,122 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-10-16 04:42:03,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:03,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:03,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:42:03,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:03,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:42:03,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:03,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:42:03,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:03,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:42:03,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:03,178 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 04:42:03,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:03,179 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 04:42:03,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:03,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:42:03,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:42:03,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:42:03,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:03,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:42:03,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:42:03,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:42:03,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:03,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:03,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:03,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:42:03,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:03,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:42:03,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:03,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:42:03,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:03,510 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:42:03,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:03,513 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 04:42:03,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:03,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:42:03,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:03,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:42:03,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:42:04,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:04,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 04:42:04,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:04,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 04:42:04,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:04,283 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:04,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,284 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:04,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:04,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:04,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,293 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:04,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:04,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:04,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,315 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:04,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:04,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:04,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:04,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:04,323 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:04,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:04,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:04,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:04,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:04,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:04,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:04,418 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:04,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:04,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:04,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:04,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:04,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:04,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:04,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:04,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:04,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:04,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,546 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,548 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:04,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:04,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:04,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:04,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:04,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:04,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:04,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:04,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:04,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:04,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:04,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:04,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:04,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:04,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:42:04,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:04,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:42:04,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:04,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:42:04,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:04,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:42:04,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:04,704 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 04:42:04,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:04,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:42:04,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:04,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:42:04,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:42:04,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:42:04,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:04,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:04,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:04,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:04,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:04,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:04,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:04,871 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:04,875 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:04,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:04,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:04,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:04,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:04,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:04,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:04,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:04,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:04,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:04,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:04,992 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:04,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:04,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:04,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:04,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:05,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:05,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:05,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:05,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:05,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:05,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:05,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:05,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:05,802 WARN L193 SmtUtils]: Spent 744.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 115 [2020-10-16 04:42:06,111 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-10-16 04:42:06,510 WARN L193 SmtUtils]: Spent 397.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-10-16 04:42:06,940 WARN L193 SmtUtils]: Spent 428.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-10-16 04:42:06,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:06,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:06,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:42:06,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:06,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:42:06,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:06,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:42:06,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:06,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:42:06,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:06,975 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 04:42:06,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:06,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:42:06,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:07,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:42:07,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:42:07,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:42:07,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:07,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:42:07,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:42:07,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:42:07,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:07,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:07,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:07,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:42:07,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:07,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:42:07,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:07,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:42:07,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:07,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:42:07,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:07,102 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 04:42:07,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:07,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:42:07,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:07,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:07,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:07,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:07,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:07,135 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:07,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:07,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:07,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:07,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:07,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:07,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:07,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:07,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:07,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:07,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:07,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:42:07,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:07,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:07,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:07,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:07,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:07,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:07,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:07,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:07,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:07,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:07,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:07,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:07,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:07,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:07,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:42:07,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:07,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:42:07,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:42:07,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:42:07,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:07,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:42:07,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:42:07,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:42:07,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:07,323 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:42:07,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:07,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:42:07,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:42:07,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:42:07,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:07,329 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 04:42:07,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:07,330 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 04:42:07,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:42:09,433 WARN L193 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 150 DAG size of output: 141 [2020-10-16 04:42:10,683 WARN L193 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 138 DAG size of output: 137 [2020-10-16 04:42:11,078 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-16 04:42:11,204 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-16 04:42:11,809 WARN L193 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 137 [2020-10-16 04:42:12,101 WARN L193 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-10-16 04:42:12,170 INFO L132 LiptonReduction]: Checked pairs total: 10024 [2020-10-16 04:42:12,170 INFO L134 LiptonReduction]: Total number of compositions: 111 [2020-10-16 04:42:12,173 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15335 [2020-10-16 04:42:12,179 INFO L129 PetriNetUnfolder]: 0/8 cut-off events. [2020-10-16 04:42:12,180 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:42:12,180 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:42:12,181 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 04:42:12,181 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:42:12,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:42:12,187 INFO L82 PathProgramCache]: Analyzing trace with hash 2134301245, now seen corresponding path program 1 times [2020-10-16 04:42:12,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:42:12,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904470498] [2020-10-16 04:42:12,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:42:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:42:12,457 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 04:42:12,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904470498] [2020-10-16 04:42:12,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:42:12,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:42:12,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587358598] [2020-10-16 04:42:12,468 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:42:12,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:42:12,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:42:12,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:42:12,487 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 245 [2020-10-16 04:42:12,490 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states. [2020-10-16 04:42:12,490 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:42:12,490 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 245 [2020-10-16 04:42:12,492 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:42:12,729 INFO L129 PetriNetUnfolder]: 257/443 cut-off events. [2020-10-16 04:42:12,729 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:42:12,732 INFO L80 FinitePrefix]: Finished finitePrefix Result has 842 conditions, 443 events. 257/443 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2318 event pairs, 179 based on Foata normal form. 29/419 useless extension candidates. Maximal degree in co-relation 831. Up to 313 conditions per place. [2020-10-16 04:42:12,736 INFO L132 encePairwiseOnDemand]: 241/245 looper letters, 14 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2020-10-16 04:42:12,736 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 37 transitions, 118 flow [2020-10-16 04:42:12,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:42:12,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:42:12,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2020-10-16 04:42:12,755 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8789115646258503 [2020-10-16 04:42:12,756 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 646 transitions. [2020-10-16 04:42:12,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 646 transitions. [2020-10-16 04:42:12,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:42:12,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 646 transitions. [2020-10-16 04:42:12,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:42:12,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:42:12,779 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:42:12,782 INFO L185 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 646 transitions. [2020-10-16 04:42:12,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 37 transitions, 118 flow [2020-10-16 04:42:12,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 37 transitions, 114 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 04:42:12,787 INFO L241 Difference]: Finished difference. Result has 42 places, 31 transitions, 74 flow [2020-10-16 04:42:12,790 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2020-10-16 04:42:12,791 INFO L342 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2020-10-16 04:42:12,791 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 74 flow [2020-10-16 04:42:12,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:42:12,792 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:42:12,792 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:42:12,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:42:12,792 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:42:12,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:42:12,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1930781885, now seen corresponding path program 1 times [2020-10-16 04:42:12,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:42:12,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619546459] [2020-10-16 04:42:12,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:42:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:42:12,878 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 04:42:12,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619546459] [2020-10-16 04:42:12,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:42:12,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:42:12,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172025013] [2020-10-16 04:42:12,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:42:12,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:42:12,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:42:12,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:42:12,886 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 245 [2020-10-16 04:42:12,886 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 74 flow. Second operand 3 states. [2020-10-16 04:42:12,886 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:42:12,886 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 245 [2020-10-16 04:42:12,886 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:42:12,974 INFO L129 PetriNetUnfolder]: 29/106 cut-off events. [2020-10-16 04:42:12,974 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:42:12,975 INFO L80 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 106 events. 29/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 401 event pairs, 15 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 163. Up to 41 conditions per place. [2020-10-16 04:42:12,976 INFO L132 encePairwiseOnDemand]: 242/245 looper letters, 7 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2020-10-16 04:42:12,976 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 33 transitions, 96 flow [2020-10-16 04:42:12,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:42:12,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:42:12,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 652 transitions. [2020-10-16 04:42:12,980 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8870748299319728 [2020-10-16 04:42:12,980 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 652 transitions. [2020-10-16 04:42:12,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 652 transitions. [2020-10-16 04:42:12,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:42:12,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 652 transitions. [2020-10-16 04:42:12,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:42:12,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:42:12,985 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:42:12,985 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 74 flow. Second operand 3 states and 652 transitions. [2020-10-16 04:42:12,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 33 transitions, 96 flow [2020-10-16 04:42:12,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 33 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:42:12,987 INFO L241 Difference]: Finished difference. Result has 41 places, 30 transitions, 72 flow [2020-10-16 04:42:12,988 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2020-10-16 04:42:12,988 INFO L342 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2020-10-16 04:42:12,988 INFO L481 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 72 flow [2020-10-16 04:42:12,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:42:12,989 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:42:12,989 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:42:12,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:42:12,989 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:42:12,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:42:12,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1687303614, now seen corresponding path program 1 times [2020-10-16 04:42:12,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:42:12,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823433583] [2020-10-16 04:42:12,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:42:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:42:13,108 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 04:42:13,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823433583] [2020-10-16 04:42:13,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:42:13,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:42:13,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567340712] [2020-10-16 04:42:13,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:42:13,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:42:13,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:42:13,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:42:13,111 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 245 [2020-10-16 04:42:13,112 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 72 flow. Second operand 3 states. [2020-10-16 04:42:13,112 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:42:13,112 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 245 [2020-10-16 04:42:13,112 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:42:13,269 INFO L129 PetriNetUnfolder]: 237/414 cut-off events. [2020-10-16 04:42:13,269 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:42:13,272 INFO L80 FinitePrefix]: Finished finitePrefix Result has 784 conditions, 414 events. 237/414 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2144 event pairs, 167 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 775. Up to 305 conditions per place. [2020-10-16 04:42:13,274 INFO L132 encePairwiseOnDemand]: 242/245 looper letters, 11 selfloop transitions, 2 changer transitions 2/35 dead transitions. [2020-10-16 04:42:13,274 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 35 transitions, 112 flow [2020-10-16 04:42:13,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:42:13,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:42:13,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 622 transitions. [2020-10-16 04:42:13,278 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8462585034013606 [2020-10-16 04:42:13,279 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 622 transitions. [2020-10-16 04:42:13,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 622 transitions. [2020-10-16 04:42:13,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:42:13,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 622 transitions. [2020-10-16 04:42:13,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:42:13,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:42:13,282 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:42:13,282 INFO L185 Difference]: Start difference. First operand has 41 places, 30 transitions, 72 flow. Second operand 3 states and 622 transitions. [2020-10-16 04:42:13,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 35 transitions, 112 flow [2020-10-16 04:42:13,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 35 transitions, 108 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:42:13,284 INFO L241 Difference]: Finished difference. Result has 42 places, 29 transitions, 74 flow [2020-10-16 04:42:13,284 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2020-10-16 04:42:13,285 INFO L342 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2020-10-16 04:42:13,285 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 74 flow [2020-10-16 04:42:13,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:42:13,285 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:42:13,285 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:42:13,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:42:13,286 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:42:13,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:42:13,286 INFO L82 PathProgramCache]: Analyzing trace with hash 189771308, now seen corresponding path program 1 times [2020-10-16 04:42:13,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:42:13,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193331562] [2020-10-16 04:42:13,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:42:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:42:13,409 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 04:42:13,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193331562] [2020-10-16 04:42:13,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:42:13,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:42:13,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253236323] [2020-10-16 04:42:13,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:42:13,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:42:13,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:42:13,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:42:13,412 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 245 [2020-10-16 04:42:13,413 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 74 flow. Second operand 3 states. [2020-10-16 04:42:13,413 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:42:13,413 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 245 [2020-10-16 04:42:13,413 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:42:13,427 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2020-10-16 04:42:13,427 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-16 04:42:13,428 INFO L80 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 29 events. 0/29 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2020-10-16 04:42:13,428 INFO L132 encePairwiseOnDemand]: 242/245 looper letters, 1 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2020-10-16 04:42:13,428 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 80 flow [2020-10-16 04:42:13,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:42:13,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:42:13,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 661 transitions. [2020-10-16 04:42:13,432 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8993197278911564 [2020-10-16 04:42:13,432 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 661 transitions. [2020-10-16 04:42:13,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 661 transitions. [2020-10-16 04:42:13,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:42:13,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 661 transitions. [2020-10-16 04:42:13,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:42:13,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:42:13,436 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:42:13,436 INFO L185 Difference]: Start difference. First operand has 42 places, 29 transitions, 74 flow. Second operand 3 states and 661 transitions. [2020-10-16 04:42:13,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 80 flow [2020-10-16 04:42:13,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 29 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:42:13,437 INFO L241 Difference]: Finished difference. Result has 42 places, 29 transitions, 78 flow [2020-10-16 04:42:13,437 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2020-10-16 04:42:13,437 INFO L342 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2020-10-16 04:42:13,438 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 78 flow [2020-10-16 04:42:13,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:42:13,438 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:42:13,438 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:42:13,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:42:13,438 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:42:13,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:42:13,439 INFO L82 PathProgramCache]: Analyzing trace with hash 605217985, now seen corresponding path program 1 times [2020-10-16 04:42:13,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:42:13,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876241348] [2020-10-16 04:42:13,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:42:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:42:13,491 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 04:42:13,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876241348] [2020-10-16 04:42:13,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:42:13,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:42:13,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104552745] [2020-10-16 04:42:13,493 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:42:13,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:42:13,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:42:13,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:42:13,494 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 245 [2020-10-16 04:42:13,495 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 78 flow. Second operand 3 states. [2020-10-16 04:42:13,495 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:42:13,495 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 245 [2020-10-16 04:42:13,495 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:42:13,512 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2020-10-16 04:42:13,513 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2020-10-16 04:42:13,513 INFO L80 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 29 events. 0/29 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2020-10-16 04:42:13,513 INFO L132 encePairwiseOnDemand]: 242/245 looper letters, 1 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2020-10-16 04:42:13,513 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 29 transitions, 84 flow [2020-10-16 04:42:13,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:42:13,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:42:13,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 664 transitions. [2020-10-16 04:42:13,517 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.9034013605442177 [2020-10-16 04:42:13,517 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 664 transitions. [2020-10-16 04:42:13,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 664 transitions. [2020-10-16 04:42:13,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:42:13,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 664 transitions. [2020-10-16 04:42:13,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:42:13,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:42:13,520 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:42:13,521 INFO L185 Difference]: Start difference. First operand has 42 places, 29 transitions, 78 flow. Second operand 3 states and 664 transitions. [2020-10-16 04:42:13,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 29 transitions, 84 flow [2020-10-16 04:42:13,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 29 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:42:13,522 INFO L241 Difference]: Finished difference. Result has 43 places, 29 transitions, 82 flow [2020-10-16 04:42:13,522 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2020-10-16 04:42:13,523 INFO L342 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2020-10-16 04:42:13,523 INFO L481 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 82 flow [2020-10-16 04:42:13,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:42:13,523 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:42:13,523 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:42:13,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:42:13,523 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:42:13,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:42:13,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1231140927, now seen corresponding path program 1 times [2020-10-16 04:42:13,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:42:13,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161145465] [2020-10-16 04:42:13,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:42:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:42:13,706 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 04:42:13,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161145465] [2020-10-16 04:42:13,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:42:13,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:42:13,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950203348] [2020-10-16 04:42:13,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:42:13,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:42:13,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:42:13,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:42:13,710 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 245 [2020-10-16 04:42:13,710 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 82 flow. Second operand 4 states. [2020-10-16 04:42:13,710 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:42:13,710 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 245 [2020-10-16 04:42:13,711 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:42:13,789 INFO L129 PetriNetUnfolder]: 90/188 cut-off events. [2020-10-16 04:42:13,789 INFO L130 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2020-10-16 04:42:13,790 INFO L80 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 188 events. 90/188 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 818 event pairs, 46 based on Foata normal form. 16/202 useless extension candidates. Maximal degree in co-relation 392. Up to 119 conditions per place. [2020-10-16 04:42:13,791 INFO L132 encePairwiseOnDemand]: 238/245 looper letters, 6 selfloop transitions, 5 changer transitions 9/42 dead transitions. [2020-10-16 04:42:13,792 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 42 transitions, 148 flow [2020-10-16 04:42:13,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:42:13,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:42:13,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1057 transitions. [2020-10-16 04:42:13,796 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8628571428571429 [2020-10-16 04:42:13,796 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1057 transitions. [2020-10-16 04:42:13,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1057 transitions. [2020-10-16 04:42:13,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:42:13,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1057 transitions. [2020-10-16 04:42:13,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:42:13,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:42:13,802 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:42:13,803 INFO L185 Difference]: Start difference. First operand has 43 places, 29 transitions, 82 flow. Second operand 5 states and 1057 transitions. [2020-10-16 04:42:13,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 42 transitions, 148 flow [2020-10-16 04:42:13,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 42 transitions, 140 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-16 04:42:13,805 INFO L241 Difference]: Finished difference. Result has 47 places, 33 transitions, 119 flow [2020-10-16 04:42:13,805 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2020-10-16 04:42:13,806 INFO L342 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2020-10-16 04:42:13,806 INFO L481 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 119 flow [2020-10-16 04:42:13,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:42:13,806 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:42:13,806 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:42:13,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:42:13,806 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:42:13,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:42:13,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1927117387, now seen corresponding path program 1 times [2020-10-16 04:42:13,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:42:13,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317682210] [2020-10-16 04:42:13,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:42:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:42:14,095 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 04:42:14,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317682210] [2020-10-16 04:42:14,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:42:14,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:42:14,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816808281] [2020-10-16 04:42:14,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:42:14,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:42:14,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:42:14,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:42:14,099 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 245 [2020-10-16 04:42:14,101 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 119 flow. Second operand 5 states. [2020-10-16 04:42:14,101 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:42:14,102 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 245 [2020-10-16 04:42:14,102 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:42:14,322 INFO L129 PetriNetUnfolder]: 66/151 cut-off events. [2020-10-16 04:42:14,322 INFO L130 PetriNetUnfolder]: For 107/124 co-relation queries the response was YES. [2020-10-16 04:42:14,323 INFO L80 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 151 events. 66/151 cut-off events. For 107/124 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 592 event pairs, 14 based on Foata normal form. 22/171 useless extension candidates. Maximal degree in co-relation 518. Up to 108 conditions per place. [2020-10-16 04:42:14,324 INFO L132 encePairwiseOnDemand]: 238/245 looper letters, 6 selfloop transitions, 9 changer transitions 9/46 dead transitions. [2020-10-16 04:42:14,325 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 243 flow [2020-10-16 04:42:14,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:42:14,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:42:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1268 transitions. [2020-10-16 04:42:14,329 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8625850340136054 [2020-10-16 04:42:14,330 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1268 transitions. [2020-10-16 04:42:14,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1268 transitions. [2020-10-16 04:42:14,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:42:14,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1268 transitions. [2020-10-16 04:42:14,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:42:14,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:42:14,337 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:42:14,337 INFO L185 Difference]: Start difference. First operand has 47 places, 33 transitions, 119 flow. Second operand 6 states and 1268 transitions. [2020-10-16 04:42:14,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 243 flow [2020-10-16 04:42:14,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 236 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 04:42:14,340 INFO L241 Difference]: Finished difference. Result has 51 places, 37 transitions, 184 flow [2020-10-16 04:42:14,340 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2020-10-16 04:42:14,341 INFO L342 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2020-10-16 04:42:14,341 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 184 flow [2020-10-16 04:42:14,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:42:14,341 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:42:14,341 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:42:14,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:42:14,341 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:42:14,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:42:14,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1199226940, now seen corresponding path program 1 times [2020-10-16 04:42:14,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:42:14,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548831941] [2020-10-16 04:42:14,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:42:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:42:14,557 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 04:42:14,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548831941] [2020-10-16 04:42:14,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:42:14,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:42:14,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2392909] [2020-10-16 04:42:14,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:42:14,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:42:14,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:42:14,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:42:14,561 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 245 [2020-10-16 04:42:14,562 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 184 flow. Second operand 6 states. [2020-10-16 04:42:14,562 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:42:14,562 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 245 [2020-10-16 04:42:14,562 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:42:14,649 INFO L129 PetriNetUnfolder]: 36/98 cut-off events. [2020-10-16 04:42:14,649 INFO L130 PetriNetUnfolder]: For 188/222 co-relation queries the response was YES. [2020-10-16 04:42:14,650 INFO L80 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 98 events. 36/98 cut-off events. For 188/222 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 306 event pairs, 2 based on Foata normal form. 25/121 useless extension candidates. Maximal degree in co-relation 437. Up to 68 conditions per place. [2020-10-16 04:42:14,651 INFO L132 encePairwiseOnDemand]: 238/245 looper letters, 6 selfloop transitions, 13 changer transitions 9/50 dead transitions. [2020-10-16 04:42:14,651 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 50 transitions, 366 flow [2020-10-16 04:42:14,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:42:14,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:42:14,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1479 transitions. [2020-10-16 04:42:14,657 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8623906705539358 [2020-10-16 04:42:14,657 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1479 transitions. [2020-10-16 04:42:14,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1479 transitions. [2020-10-16 04:42:14,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:42:14,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1479 transitions. [2020-10-16 04:42:14,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:42:14,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:42:14,664 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:42:14,664 INFO L185 Difference]: Start difference. First operand has 51 places, 37 transitions, 184 flow. Second operand 7 states and 1479 transitions. [2020-10-16 04:42:14,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 50 transitions, 366 flow [2020-10-16 04:42:14,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 50 transitions, 304 flow, removed 26 selfloop flow, removed 4 redundant places. [2020-10-16 04:42:14,668 INFO L241 Difference]: Finished difference. Result has 54 places, 41 transitions, 234 flow [2020-10-16 04:42:14,668 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=234, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2020-10-16 04:42:14,669 INFO L342 CegarLoopForPetriNet]: 45 programPoint places, 9 predicate places. [2020-10-16 04:42:14,669 INFO L481 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 234 flow [2020-10-16 04:42:14,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:42:14,669 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:42:14,669 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:42:14,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:42:14,669 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:42:14,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:42:14,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1372327440, now seen corresponding path program 1 times [2020-10-16 04:42:14,670 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:42:14,670 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780890809] [2020-10-16 04:42:14,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:42:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:42:14,803 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 04:42:14,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780890809] [2020-10-16 04:42:14,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:42:14,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 04:42:14,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621635401] [2020-10-16 04:42:14,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 04:42:14,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:42:14,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 04:42:14,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-16 04:42:14,808 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 245 [2020-10-16 04:42:14,809 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 234 flow. Second operand 9 states. [2020-10-16 04:42:14,809 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:42:14,809 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 245 [2020-10-16 04:42:14,809 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:42:15,064 INFO L129 PetriNetUnfolder]: 108/252 cut-off events. [2020-10-16 04:42:15,064 INFO L130 PetriNetUnfolder]: For 809/824 co-relation queries the response was YES. [2020-10-16 04:42:15,065 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1069 conditions, 252 events. 108/252 cut-off events. For 809/824 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1189 event pairs, 16 based on Foata normal form. 20/269 useless extension candidates. Maximal degree in co-relation 1051. Up to 137 conditions per place. [2020-10-16 04:42:15,067 INFO L132 encePairwiseOnDemand]: 237/245 looper letters, 17 selfloop transitions, 17 changer transitions 21/75 dead transitions. [2020-10-16 04:42:15,067 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 75 transitions, 618 flow [2020-10-16 04:42:15,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 04:42:15,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 04:42:15,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2260 transitions. [2020-10-16 04:42:15,074 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8385899814471243 [2020-10-16 04:42:15,075 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2260 transitions. [2020-10-16 04:42:15,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2260 transitions. [2020-10-16 04:42:15,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:42:15,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2260 transitions. [2020-10-16 04:42:15,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 04:42:15,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 04:42:15,086 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 04:42:15,086 INFO L185 Difference]: Start difference. First operand has 54 places, 41 transitions, 234 flow. Second operand 11 states and 2260 transitions. [2020-10-16 04:42:15,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 75 transitions, 618 flow [2020-10-16 04:42:15,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 75 transitions, 478 flow, removed 46 selfloop flow, removed 5 redundant places. [2020-10-16 04:42:15,093 INFO L241 Difference]: Finished difference. Result has 65 places, 53 transitions, 352 flow [2020-10-16 04:42:15,093 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=352, PETRI_PLACES=65, PETRI_TRANSITIONS=53} [2020-10-16 04:42:15,094 INFO L342 CegarLoopForPetriNet]: 45 programPoint places, 20 predicate places. [2020-10-16 04:42:15,094 INFO L481 AbstractCegarLoop]: Abstraction has has 65 places, 53 transitions, 352 flow [2020-10-16 04:42:15,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 04:42:15,094 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:42:15,094 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:42:15,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:42:15,094 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:42:15,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:42:15,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1912204110, now seen corresponding path program 2 times [2020-10-16 04:42:15,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:42:15,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168329100] [2020-10-16 04:42:15,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:42:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:42:15,403 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 04:42:15,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168329100] [2020-10-16 04:42:15,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:42:15,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:42:15,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078357564] [2020-10-16 04:42:15,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:42:15,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:42:15,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:42:15,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:42:15,409 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 245 [2020-10-16 04:42:15,410 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 53 transitions, 352 flow. Second operand 7 states. [2020-10-16 04:42:15,410 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:42:15,411 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 245 [2020-10-16 04:42:15,411 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:42:15,523 INFO L129 PetriNetUnfolder]: 49/130 cut-off events. [2020-10-16 04:42:15,523 INFO L130 PetriNetUnfolder]: For 489/529 co-relation queries the response was YES. [2020-10-16 04:42:15,524 INFO L80 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 130 events. 49/130 cut-off events. For 489/529 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 478 event pairs, 4 based on Foata normal form. 30/157 useless extension candidates. Maximal degree in co-relation 579. Up to 49 conditions per place. [2020-10-16 04:42:15,525 INFO L132 encePairwiseOnDemand]: 238/245 looper letters, 2 selfloop transitions, 29 changer transitions 4/58 dead transitions. [2020-10-16 04:42:15,525 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 58 transitions, 478 flow [2020-10-16 04:42:15,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:42:15,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:42:15,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1682 transitions. [2020-10-16 04:42:15,531 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8581632653061224 [2020-10-16 04:42:15,531 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1682 transitions. [2020-10-16 04:42:15,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1682 transitions. [2020-10-16 04:42:15,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:42:15,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1682 transitions. [2020-10-16 04:42:15,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:42:15,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:42:15,540 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:42:15,540 INFO L185 Difference]: Start difference. First operand has 65 places, 53 transitions, 352 flow. Second operand 8 states and 1682 transitions. [2020-10-16 04:42:15,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 58 transitions, 478 flow [2020-10-16 04:42:15,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 402 flow, removed 28 selfloop flow, removed 8 redundant places. [2020-10-16 04:42:15,545 INFO L241 Difference]: Finished difference. Result has 62 places, 54 transitions, 378 flow [2020-10-16 04:42:15,545 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=378, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2020-10-16 04:42:15,545 INFO L342 CegarLoopForPetriNet]: 45 programPoint places, 17 predicate places. [2020-10-16 04:42:15,545 INFO L481 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 378 flow [2020-10-16 04:42:15,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:42:15,546 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:42:15,546 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:42:15,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:42:15,546 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:42:15,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:42:15,546 INFO L82 PathProgramCache]: Analyzing trace with hash 2114330646, now seen corresponding path program 1 times [2020-10-16 04:42:15,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:42:15,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889401061] [2020-10-16 04:42:15,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:42:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:42:15,722 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 04:42:15,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889401061] [2020-10-16 04:42:15,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:42:15,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 04:42:15,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645760954] [2020-10-16 04:42:15,723 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 04:42:15,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:42:15,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 04:42:15,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-16 04:42:15,726 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 245 [2020-10-16 04:42:15,727 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 378 flow. Second operand 10 states. [2020-10-16 04:42:15,727 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:42:15,728 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 245 [2020-10-16 04:42:15,728 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:42:16,297 INFO L129 PetriNetUnfolder]: 265/596 cut-off events. [2020-10-16 04:42:16,297 INFO L130 PetriNetUnfolder]: For 2455/2496 co-relation queries the response was YES. [2020-10-16 04:42:16,301 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2633 conditions, 596 events. 265/596 cut-off events. For 2455/2496 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 3867 event pairs, 47 based on Foata normal form. 16/597 useless extension candidates. Maximal degree in co-relation 2612. Up to 197 conditions per place. [2020-10-16 04:42:16,307 INFO L132 encePairwiseOnDemand]: 237/245 looper letters, 27 selfloop transitions, 30 changer transitions 53/130 dead transitions. [2020-10-16 04:42:16,307 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 130 transitions, 1251 flow [2020-10-16 04:42:16,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 04:42:16,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 04:42:16,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2590 transitions. [2020-10-16 04:42:16,318 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8131868131868132 [2020-10-16 04:42:16,318 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2590 transitions. [2020-10-16 04:42:16,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2590 transitions. [2020-10-16 04:42:16,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:42:16,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2590 transitions. [2020-10-16 04:42:16,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 04:42:16,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 04:42:16,331 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 04:42:16,331 INFO L185 Difference]: Start difference. First operand has 62 places, 54 transitions, 378 flow. Second operand 13 states and 2590 transitions. [2020-10-16 04:42:16,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 130 transitions, 1251 flow [2020-10-16 04:42:16,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 130 transitions, 1028 flow, removed 47 selfloop flow, removed 6 redundant places. [2020-10-16 04:42:16,352 INFO L241 Difference]: Finished difference. Result has 77 places, 73 transitions, 651 flow [2020-10-16 04:42:16,352 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=651, PETRI_PLACES=77, PETRI_TRANSITIONS=73} [2020-10-16 04:42:16,353 INFO L342 CegarLoopForPetriNet]: 45 programPoint places, 32 predicate places. [2020-10-16 04:42:16,353 INFO L481 AbstractCegarLoop]: Abstraction has has 77 places, 73 transitions, 651 flow [2020-10-16 04:42:16,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 04:42:16,353 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:42:16,353 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:42:16,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 04:42:16,353 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:42:16,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:42:16,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1784834460, now seen corresponding path program 2 times [2020-10-16 04:42:16,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:42:16,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208988885] [2020-10-16 04:42:16,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:42:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:42:16,445 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 04:42:16,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208988885] [2020-10-16 04:42:16,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:42:16,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:42:16,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452300959] [2020-10-16 04:42:16,446 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:42:16,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:42:16,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:42:16,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:42:16,448 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 245 [2020-10-16 04:42:16,449 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 73 transitions, 651 flow. Second operand 4 states. [2020-10-16 04:42:16,449 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:42:16,449 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 245 [2020-10-16 04:42:16,449 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:42:16,522 INFO L129 PetriNetUnfolder]: 118/320 cut-off events. [2020-10-16 04:42:16,522 INFO L130 PetriNetUnfolder]: For 1803/1857 co-relation queries the response was YES. [2020-10-16 04:42:16,524 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1526 conditions, 320 events. 118/320 cut-off events. For 1803/1857 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1873 event pairs, 16 based on Foata normal form. 21/324 useless extension candidates. Maximal degree in co-relation 1500. Up to 102 conditions per place. [2020-10-16 04:42:16,526 INFO L132 encePairwiseOnDemand]: 242/245 looper letters, 3 selfloop transitions, 2 changer transitions 10/74 dead transitions. [2020-10-16 04:42:16,526 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 74 transitions, 671 flow [2020-10-16 04:42:16,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:42:16,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:42:16,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 870 transitions. [2020-10-16 04:42:16,530 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8877551020408163 [2020-10-16 04:42:16,530 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 870 transitions. [2020-10-16 04:42:16,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 870 transitions. [2020-10-16 04:42:16,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:42:16,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 870 transitions. [2020-10-16 04:42:16,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:42:16,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:42:16,535 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:42:16,535 INFO L185 Difference]: Start difference. First operand has 77 places, 73 transitions, 651 flow. Second operand 4 states and 870 transitions. [2020-10-16 04:42:16,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 74 transitions, 671 flow [2020-10-16 04:42:16,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 74 transitions, 601 flow, removed 28 selfloop flow, removed 8 redundant places. [2020-10-16 04:42:16,549 INFO L241 Difference]: Finished difference. Result has 66 places, 64 transitions, 492 flow [2020-10-16 04:42:16,549 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=492, PETRI_PLACES=66, PETRI_TRANSITIONS=64} [2020-10-16 04:42:16,549 INFO L342 CegarLoopForPetriNet]: 45 programPoint places, 21 predicate places. [2020-10-16 04:42:16,550 INFO L481 AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 492 flow [2020-10-16 04:42:16,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:42:16,550 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:42:16,550 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:42:16,550 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 04:42:16,550 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:42:16,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:42:16,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1502186044, now seen corresponding path program 3 times [2020-10-16 04:42:16,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:42:16,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835756588] [2020-10-16 04:42:16,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:42:16,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:42:16,631 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 04:42:16,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835756588] [2020-10-16 04:42:16,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:42:16,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:42:16,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969216139] [2020-10-16 04:42:16,632 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:42:16,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:42:16,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:42:16,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:42:16,634 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 245 [2020-10-16 04:42:16,635 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 492 flow. Second operand 4 states. [2020-10-16 04:42:16,635 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:42:16,635 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 245 [2020-10-16 04:42:16,635 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:42:16,700 INFO L129 PetriNetUnfolder]: 85/267 cut-off events. [2020-10-16 04:42:16,700 INFO L130 PetriNetUnfolder]: For 1050/1095 co-relation queries the response was YES. [2020-10-16 04:42:16,702 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1115 conditions, 267 events. 85/267 cut-off events. For 1050/1095 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1562 event pairs, 8 based on Foata normal form. 13/266 useless extension candidates. Maximal degree in co-relation 1095. Up to 74 conditions per place. [2020-10-16 04:42:16,703 INFO L132 encePairwiseOnDemand]: 242/245 looper letters, 4 selfloop transitions, 2 changer transitions 2/66 dead transitions. [2020-10-16 04:42:16,704 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 66 transitions, 518 flow [2020-10-16 04:42:16,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:42:16,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:42:16,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 844 transitions. [2020-10-16 04:42:16,708 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8612244897959184 [2020-10-16 04:42:16,708 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 844 transitions. [2020-10-16 04:42:16,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 844 transitions. [2020-10-16 04:42:16,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:42:16,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 844 transitions. [2020-10-16 04:42:16,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:42:16,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:42:16,713 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:42:16,713 INFO L185 Difference]: Start difference. First operand has 66 places, 64 transitions, 492 flow. Second operand 4 states and 844 transitions. [2020-10-16 04:42:16,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 66 transitions, 518 flow [2020-10-16 04:42:16,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 66 transitions, 507 flow, removed 2 selfloop flow, removed 3 redundant places. [2020-10-16 04:42:16,720 INFO L241 Difference]: Finished difference. Result has 67 places, 64 transitions, 491 flow [2020-10-16 04:42:16,720 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=491, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2020-10-16 04:42:16,721 INFO L342 CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places. [2020-10-16 04:42:16,721 INFO L481 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 491 flow [2020-10-16 04:42:16,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:42:16,721 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:42:16,721 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:42:16,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 04:42:16,722 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:42:16,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:42:16,722 INFO L82 PathProgramCache]: Analyzing trace with hash 407477466, now seen corresponding path program 4 times [2020-10-16 04:42:16,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:42:16,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212307705] [2020-10-16 04:42:16,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:42:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:42:16,919 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:42:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:42:17,071 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:42:17,119 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 04:42:17,119 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 04:42:17,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 04:42:17,121 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 04:42:17,162 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [2182] [2182] L2-->L934: Formula: (let ((.cse12 (= (mod ~y$r_buff1_thd0~0_In-614145958 256) 0)) (.cse13 (= 0 (mod ~y$w_buff1_used~0_In-614145958 256))) (.cse14 (= (mod ~x$w_buff1_used~0_In-614145958 256) 0)) (.cse15 (= (mod ~x$r_buff1_thd0~0_In-614145958 256) 0)) (.cse17 (= (mod ~y$r_buff0_thd0~0_In-614145958 256) 0)) (.cse16 (= (mod ~y$w_buff0_used~0_In-614145958 256) 0)) (.cse18 (= (mod ~x$w_buff0_used~0_In-614145958 256) 0)) (.cse19 (= (mod ~x$r_buff0_thd0~0_In-614145958 256) 0))) (let ((.cse0 (or .cse18 .cse19)) (.cse1 (not .cse19)) (.cse2 (not .cse18)) (.cse3 (or .cse17 .cse16)) (.cse4 (not .cse17)) (.cse5 (not .cse16)) (.cse7 (not .cse15)) (.cse8 (not .cse14)) (.cse6 (or .cse14 .cse15)) (.cse11 (or .cse12 .cse13)) (.cse9 (not .cse13)) (.cse10 (not .cse12))) (and (or (and (= ~x$w_buff0_used~0_In-614145958 ~x$w_buff0_used~0_Out-614145958) .cse0) (and .cse1 .cse2 (= ~x$w_buff0_used~0_Out-614145958 0))) (or (and .cse3 (= ~y$w_buff0_used~0_In-614145958 ~y$w_buff0_used~0_Out-614145958)) (and .cse4 .cse5 (= ~y$w_buff0_used~0_Out-614145958 0))) (or (and (or (and .cse6 (= ~x~0_In-614145958 ~x~0_Out-614145958)) (and (= ~x$w_buff1~0_In-614145958 ~x~0_Out-614145958) .cse7 .cse8)) .cse0) (and .cse1 (= ~x$w_buff0~0_In-614145958 ~x~0_Out-614145958) .cse2)) (or (and (or (and (= ~y$w_buff1~0_In-614145958 ~y~0_Out-614145958) .cse9 .cse10) (and (= ~y~0_In-614145958 ~y~0_Out-614145958) .cse11)) .cse3) (and .cse4 (= ~y$w_buff0~0_In-614145958 ~y~0_Out-614145958) .cse5)) (or (and (= ~x$w_buff1_used~0_Out-614145958 0) .cse7 .cse8) (and (= ~x$w_buff1_used~0_In-614145958 ~x$w_buff1_used~0_Out-614145958) .cse6)) (= ~x$r_buff0_thd0~0_Out-614145958 ~x$r_buff0_thd0~0_In-614145958) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-614145958 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-614145958|) (or (and .cse11 (= ~y$w_buff1_used~0_Out-614145958 ~y$w_buff1_used~0_In-614145958)) (and (= ~y$w_buff1_used~0_Out-614145958 0) .cse9 .cse10)) (= ~x$r_buff1_thd0~0_Out-614145958 ~x$r_buff1_thd0~0_In-614145958) (= ~y$r_buff0_thd0~0_Out-614145958 ~y$r_buff0_thd0~0_In-614145958) (= ~y$r_buff1_thd0~0_In-614145958 ~y$r_buff1_thd0~0_Out-614145958) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-614145958 0))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-614145958, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-614145958, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-614145958, ~x$w_buff1~0=~x$w_buff1~0_In-614145958, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-614145958, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-614145958, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-614145958, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-614145958|, ~y$w_buff1~0=~y$w_buff1~0_In-614145958, ~y$w_buff0~0=~y$w_buff0~0_In-614145958, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-614145958, ~y~0=~y~0_In-614145958, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-614145958, ~x~0=~x~0_In-614145958, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-614145958} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-614145958, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out-614145958, ULTIMATE.start_main_#t~ite89=|ULTIMATE.start_main_#t~ite89_Out-614145958|, ULTIMATE.start_main_#t~ite88=|ULTIMATE.start_main_#t~ite88_Out-614145958|, ULTIMATE.start_main_#t~ite96=|ULTIMATE.start_main_#t~ite96_Out-614145958|, ULTIMATE.start_main_#t~ite95=|ULTIMATE.start_main_#t~ite95_Out-614145958|, ULTIMATE.start_main_#t~ite94=|ULTIMATE.start_main_#t~ite94_Out-614145958|, ULTIMATE.start_main_#t~ite93=|ULTIMATE.start_main_#t~ite93_Out-614145958|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-614145958, ULTIMATE.start_main_#t~ite92=|ULTIMATE.start_main_#t~ite92_Out-614145958|, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out-614145958|, ~y$w_buff0~0=~y$w_buff0~0_In-614145958, ULTIMATE.start_main_#t~ite90=|ULTIMATE.start_main_#t~ite90_Out-614145958|, ~y~0=~y~0_Out-614145958, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-614145958, ~x$w_buff1~0=~x$w_buff1~0_In-614145958, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-614145958, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-614145958, ULTIMATE.start_main_#t~ite99=|ULTIMATE.start_main_#t~ite99_Out-614145958|, ULTIMATE.start_main_#t~ite98=|ULTIMATE.start_main_#t~ite98_Out-614145958|, ULTIMATE.start_main_#t~ite97=|ULTIMATE.start_main_#t~ite97_Out-614145958|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-614145958, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-614145958|, ~y$w_buff1~0=~y$w_buff1~0_In-614145958, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-614145958, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-614145958, ~x~0=~x~0_Out-614145958, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-614145958} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~y$w_buff0_used~0, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite89, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite99, ULTIMATE.start_main_#t~ite98, ULTIMATE.start_main_#t~ite97, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite96, ULTIMATE.start_main_#t~ite95, 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, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 04:42:17,170 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 04:42:17,171 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,173 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 04:42:17,173 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,173 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 04:42:17,173 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,174 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 04:42:17,174 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,174 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 04:42:17,174 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,174 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 04:42:17,174 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,175 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 04:42:17,175 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,175 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 04:42:17,175 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,176 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 04:42:17,176 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,176 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 04:42:17,176 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,176 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 04:42:17,176 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,177 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 04:42:17,177 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,177 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 04:42:17,177 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,177 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 04:42:17,177 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,178 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 04:42:17,178 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,178 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 04:42:17,178 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,178 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 04:42:17,178 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,179 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 04:42:17,179 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,179 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 04:42:17,179 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,180 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 04:42:17,180 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,180 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 04:42:17,180 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,180 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 04:42:17,180 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,180 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 04:42:17,181 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,181 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 04:42:17,181 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,181 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 04:42:17,181 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,181 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 04:42:17,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,182 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 04:42:17,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,182 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 04:42:17,182 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,182 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 04:42:17,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,183 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 04:42:17,183 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,183 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 04:42:17,184 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,184 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 04:42:17,184 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,184 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 04:42:17,184 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,185 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 04:42:17,185 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,186 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 04:42:17,186 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,186 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 04:42:17,187 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,187 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 04:42:17,187 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,187 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 04:42:17,188 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,188 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 04:42:17,188 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,188 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 04:42:17,188 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,189 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 04:42:17,189 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,189 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 04:42:17,189 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,190 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 04:42:17,190 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,190 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 04:42:17,190 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,191 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 04:42:17,191 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,191 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 04:42:17,191 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,192 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 04:42:17,192 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,192 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 04:42:17,192 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,193 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 04:42:17,193 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,193 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 04:42:17,193 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,194 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 04:42:17,194 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,194 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 04:42:17,194 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,195 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 04:42:17,195 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,195 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 04:42:17,195 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,196 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 04:42:17,196 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,196 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 04:42:17,196 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,197 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 04:42:17,198 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,198 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 04:42:17,198 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,198 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 04:42:17,198 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,198 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 04:42:17,199 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,199 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 04:42:17,199 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,199 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 04:42:17,200 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,200 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 04:42:17,200 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,200 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 04:42:17,201 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,201 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 04:42:17,201 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,201 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 04:42:17,201 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:42:17,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:42:17 BasicIcfg [2020-10-16 04:42:17,330 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:42:17,333 INFO L168 Benchmark]: Toolchain (without parser) took 25997.76 ms. Allocated memory was 254.3 MB in the beginning and 740.3 MB in the end (delta: 486.0 MB). Free memory was 207.5 MB in the beginning and 575.1 MB in the end (delta: -367.6 MB). Peak memory consumption was 118.4 MB. Max. memory is 14.2 GB. [2020-10-16 04:42:17,334 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 254.3 MB. Free memory is still 228.1 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:42:17,338 INFO L168 Benchmark]: CACSL2BoogieTranslator took 770.58 ms. Allocated memory was 254.3 MB in the beginning and 322.4 MB in the end (delta: 68.2 MB). Free memory was 207.5 MB in the beginning and 265.6 MB in the end (delta: -58.0 MB). Peak memory consumption was 29.6 MB. Max. memory is 14.2 GB. [2020-10-16 04:42:17,339 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.11 ms. Allocated memory is still 322.4 MB. Free memory was 265.6 MB in the beginning and 260.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-16 04:42:17,341 INFO L168 Benchmark]: Boogie Preprocessor took 55.64 ms. Allocated memory is still 322.4 MB. Free memory was 260.5 MB in the beginning and 258.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:42:17,342 INFO L168 Benchmark]: RCFGBuilder took 4345.30 ms. Allocated memory was 322.4 MB in the beginning and 428.3 MB in the end (delta: 105.9 MB). Free memory was 258.0 MB in the beginning and 242.8 MB in the end (delta: 15.2 MB). Peak memory consumption was 150.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:42:17,343 INFO L168 Benchmark]: TraceAbstraction took 20740.35 ms. Allocated memory was 428.3 MB in the beginning and 740.3 MB in the end (delta: 312.0 MB). Free memory was 242.8 MB in the beginning and 575.1 MB in the end (delta: -332.3 MB). There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:42:17,356 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.41 ms. Allocated memory is still 254.3 MB. Free memory is still 228.1 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 770.58 ms. Allocated memory was 254.3 MB in the beginning and 322.4 MB in the end (delta: 68.2 MB). Free memory was 207.5 MB in the beginning and 265.6 MB in the end (delta: -58.0 MB). Peak memory consumption was 29.6 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 80.11 ms. Allocated memory is still 322.4 MB. Free memory was 265.6 MB in the beginning and 260.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 55.64 ms. Allocated memory is still 322.4 MB. Free memory was 260.5 MB in the beginning and 258.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 4345.30 ms. Allocated memory was 322.4 MB in the beginning and 428.3 MB in the end (delta: 105.9 MB). Free memory was 258.0 MB in the beginning and 242.8 MB in the end (delta: 15.2 MB). Peak memory consumption was 150.5 MB. Max. memory is 14.2 GB. * TraceAbstraction took 20740.35 ms. Allocated memory was 428.3 MB in the beginning and 740.3 MB in the end (delta: 312.0 MB). Free memory was 242.8 MB in the beginning and 575.1 MB in the end (delta: -332.3 MB). There was no memory consumed. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1884 VarBasedMoverChecksPositive, 122 VarBasedMoverChecksNegative, 43 SemBasedMoverChecksPositive, 79 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.8s, 288 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 15.3s, 141 PlacesBefore, 45 PlacesAfterwards, 130 TransitionsBefore, 33 TransitionsAfterwards, 2934 CoEnabledTransitionPairs, 8 FixpointIterations, 56 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 111 TotalNumberOfCompositions, 10024 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p1_EAX = 0; [L703] 0 int __unbuffered_p1_EBX = 0; [L705] 0 int __unbuffered_p2_EAX = 0; [L707] 0 int __unbuffered_p3_EAX = 0; [L709] 0 int __unbuffered_p3_EBX = 0; [L711] 0 int a = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff0_thd3; [L722] 0 _Bool x$r_buff0_thd4; [L723] 0 _Bool x$r_buff1_thd0; [L724] 0 _Bool x$r_buff1_thd1; [L725] 0 _Bool x$r_buff1_thd2; [L726] 0 _Bool x$r_buff1_thd3; [L727] 0 _Bool x$r_buff1_thd4; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool y$flush_delayed; [L737] 0 int y$mem_tmp; [L738] 0 _Bool y$r_buff0_thd0; [L739] 0 _Bool y$r_buff0_thd1; [L740] 0 _Bool y$r_buff0_thd2; [L741] 0 _Bool y$r_buff0_thd3; [L742] 0 _Bool y$r_buff0_thd4; [L743] 0 _Bool y$r_buff1_thd0; [L744] 0 _Bool y$r_buff1_thd1; [L745] 0 _Bool y$r_buff1_thd2; [L746] 0 _Bool y$r_buff1_thd3; [L747] 0 _Bool y$r_buff1_thd4; [L748] 0 _Bool y$read_delayed; [L749] 0 int *y$read_delayed_var; [L750] 0 int y$w_buff0; [L751] 0 _Bool y$w_buff0_used; [L752] 0 int y$w_buff1; [L753] 0 _Bool y$w_buff1_used; [L755] 0 int z = 0; [L756] 0 _Bool weak$$choice0; [L757] 0 _Bool weak$$choice2; [L911] 0 pthread_t t377; [L912] FCALL, FORK 0 pthread_create(&t377, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L913] 0 pthread_t t378; [L914] FCALL, FORK 0 pthread_create(&t378, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L915] 0 pthread_t t379; [L916] FCALL, FORK 0 pthread_create(&t379, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L840] 3 y$w_buff1 = y$w_buff0 [L841] 3 y$w_buff0 = 1 [L842] 3 y$w_buff1_used = y$w_buff0_used [L843] 3 y$w_buff0_used = (_Bool)1 [L7] COND FALSE 3 !(!expression) [L845] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L846] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L847] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L848] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L849] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L850] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L853] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L917] 0 pthread_t t380; [L918] FCALL, FORK 0 pthread_create(&t380, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L875] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L878] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L881] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L767] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L768] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L768] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L769] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L770] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L770] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L771] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L771] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L781] 2 x$w_buff1 = x$w_buff0 [L782] 2 x$w_buff0 = 2 [L783] 2 x$w_buff1_used = x$w_buff0_used [L784] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L786] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L787] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L788] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L789] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L790] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L791] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L794] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 2 x$flush_delayed = weak$$choice2 [L797] 2 x$mem_tmp = x [L798] 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) [L798] 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) [L799] 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)) [L799] 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)) [L800] 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)) [L800] 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 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1 [L800] 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 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L800] 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)) [L800] 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)) [L801] 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)) [L801] 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)) [L802] 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)) [L802] 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) [L802] 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)) [L802] 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)) [L803] 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)) [L803] 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) [L803] 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)) [L803] 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)) [L804] 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)) [L804] 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)) [L805] 2 __unbuffered_p1_EAX = x [L806] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L806] 2 x = x$flush_delayed ? x$mem_tmp : x [L807] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=11, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 2 y$flush_delayed = weak$$choice2 [L813] 2 y$mem_tmp = y [L814] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L814] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 [L814] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L814] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L815] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L815] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L816] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L816] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L817] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L817] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L818] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L818] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L819] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L819] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2) [L819] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L819] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L820] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L820] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L821] 2 __unbuffered_p1_EBX = y [L822] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L822] 2 y = y$flush_delayed ? y$mem_tmp : y [L823] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L826] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L827] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L827] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L828] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L828] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L829] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L829] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L830] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L830] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L833] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 2 return 0; [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L856] 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) [L856] 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) [L857] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L857] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L858] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L858] 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 [L859] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L859] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L860] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L860] 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 [L861] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L861] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L862] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L862] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L863] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L863] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L864] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L864] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L865] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L865] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L884] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L884] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L884] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L884] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L885] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L885] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L886] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L886] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L887] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L887] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L888] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L888] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L889] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L889] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L889] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L889] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L890] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L890] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L891] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L891] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L892] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L892] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L893] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L893] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L896] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L898] 4 return 0; [L868] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L870] 3 return 0; [L920] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L936] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L937] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L938] 0 x$flush_delayed = weak$$choice2 [L939] 0 x$mem_tmp = x [L940] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L940] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L941] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L941] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L942] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L942] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L943] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L943] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L944] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L944] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L945] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L945] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L945] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L945] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L945] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L945] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L946] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L946] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L947] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L948] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L948] 0 x = x$flush_delayed ? x$mem_tmp : x [L949] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 133 locations, 3 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: 20.3s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 15.4s, HoareTripleCheckerStatistics: 57 SDtfs, 52 SDslu, 45 SDs, 0 SdLazy, 687 SolverSat, 102 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=651occurred in iteration=11, 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, 1.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 227 ConstructedInterpolants, 0 QuantifiedInterpolants, 18851 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...