/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/mix050_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:53:39,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:53:39,044 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:53:39,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:53:39,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:53:39,093 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:53:39,096 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:53:39,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:53:39,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:53:39,107 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:53:39,108 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:53:39,109 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:53:39,109 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:53:39,112 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:53:39,115 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:53:39,116 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:53:39,118 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:53:39,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:53:39,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:53:39,130 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:53:39,131 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:53:39,135 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:53:39,136 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:53:39,137 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:53:39,139 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:53:39,140 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:53:39,140 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:53:39,141 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:53:39,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:53:39,142 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:53:39,142 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:53:39,143 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:53:39,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:53:39,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:53:39,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:53:39,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:53:39,146 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:53:39,146 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:53:39,146 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:53:39,147 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:53:39,148 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:53:39,149 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:53:39,169 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:53:39,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:53:39,171 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:53:39,171 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:53:39,171 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:53:39,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:53:39,172 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:53:39,172 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:53:39,172 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:53:39,172 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:53:39,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:53:39,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:53:39,173 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:53:39,173 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:53:39,173 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:53:39,173 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:53:39,174 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:53:39,174 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:53:39,174 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:53:39,174 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:53:39,174 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:53:39,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:53:39,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:53:39,175 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:53:39,175 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:53:39,176 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:53:39,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:53:39,176 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:53:39,176 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:53:39,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:53:39,492 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:53:39,496 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:53:39,497 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:53:39,499 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:53:39,500 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix050_pso.opt.i [2020-10-16 04:53:39,561 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cabf6b82/2a231d7a42ba44f2b9a55f2140b9c1b4/FLAG2dcbfe9f7 [2020-10-16 04:53:40,116 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:53:40,116 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix050_pso.opt.i [2020-10-16 04:53:40,135 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cabf6b82/2a231d7a42ba44f2b9a55f2140b9c1b4/FLAG2dcbfe9f7 [2020-10-16 04:53:40,400 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cabf6b82/2a231d7a42ba44f2b9a55f2140b9c1b4 [2020-10-16 04:53:40,409 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:53:40,410 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:53:40,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:53:40,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:53:40,415 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:53:40,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:53:40" (1/1) ... [2020-10-16 04:53:40,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba0a647 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:53:40, skipping insertion in model container [2020-10-16 04:53:40,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:53:40" (1/1) ... [2020-10-16 04:53:40,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:53:40,499 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:53:41,005 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:53:41,019 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:53:41,087 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:53:41,169 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:53:41,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:53:41 WrapperNode [2020-10-16 04:53:41,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:53:41,171 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:53:41,171 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:53:41,171 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:53:41,181 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:53:41" (1/1) ... [2020-10-16 04:53:41,202 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:53:41" (1/1) ... [2020-10-16 04:53:41,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:53:41,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:53:41,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:53:41,237 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:53:41,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:53:41" (1/1) ... [2020-10-16 04:53:41,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:53:41" (1/1) ... [2020-10-16 04:53:41,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:53:41" (1/1) ... [2020-10-16 04:53:41,256 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:53:41" (1/1) ... [2020-10-16 04:53:41,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:53:41" (1/1) ... [2020-10-16 04:53:41,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:53:41" (1/1) ... [2020-10-16 04:53:41,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:53:41" (1/1) ... [2020-10-16 04:53:41,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:53:41,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:53:41,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:53:41,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:53:41,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:53:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:53:41,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:53:41,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:53:41,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:53:41,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:53:41,387 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:53:41,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:53:41,389 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:53:41,389 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:53:41,390 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 04:53:41,390 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 04:53:41,393 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 04:53:41,394 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 04:53:41,394 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:53:41,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:53:41,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:53:41,397 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:53:43,704 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:53:43,704 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:53:43,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:53:43 BoogieIcfgContainer [2020-10-16 04:53:43,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:53:43,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:53:43,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:53:43,713 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:53:43,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:53:40" (1/3) ... [2020-10-16 04:53:43,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e313ee7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:53:43, skipping insertion in model container [2020-10-16 04:53:43,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:53:41" (2/3) ... [2020-10-16 04:53:43,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e313ee7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:53:43, skipping insertion in model container [2020-10-16 04:53:43,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:53:43" (3/3) ... [2020-10-16 04:53:43,717 INFO L111 eAbstractionObserver]: Analyzing ICFG mix050_pso.opt.i [2020-10-16 04:53:43,729 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:53:43,738 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:53:43,739 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:53:43,777 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,777 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,778 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,778 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,778 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,778 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,779 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,779 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,781 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,781 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,781 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,782 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,782 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,782 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,783 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,783 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,783 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,783 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,813 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,813 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,813 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,820 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,820 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,822 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,824 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,824 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,824 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,825 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,825 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,825 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,825 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,825 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,825 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,826 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,826 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,826 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,826 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,826 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,826 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,827 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,827 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,827 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,827 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,827 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,827 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,828 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,828 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,828 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,828 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,828 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,828 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,828 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,829 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,829 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,829 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,829 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,829 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,829 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,830 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,830 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,830 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,830 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,830 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,830 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,831 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,831 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,831 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,831 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,833 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,833 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,833 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,833 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,834 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,834 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,834 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,834 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,835 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,838 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,839 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,839 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,840 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,843 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,844 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,844 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,844 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,845 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,846 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,846 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,847 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,847 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,847 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,847 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,847 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,847 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,847 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,847 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,848 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,848 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,848 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,848 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,848 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,848 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,848 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,848 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,849 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,849 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,849 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,849 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,849 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,849 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,849 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,850 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,850 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,850 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,850 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,850 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,850 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,850 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,851 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,852 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,853 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,854 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,854 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,854 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,855 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,855 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:53:43,873 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 04:53:43,896 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:53:43,897 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:53:43,897 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:53:43,897 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:53:43,897 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:53:43,897 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:53:43,897 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:53:43,898 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:53:43,913 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2020-10-16 04:53:43,973 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2020-10-16 04:53:43,974 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:53:43,979 INFO L80 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 86 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-16 04:53:43,980 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 112 transitions, 244 flow [2020-10-16 04:53:43,988 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 108 transitions, 228 flow [2020-10-16 04:53:43,992 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:53:43,995 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 108 transitions, 228 flow [2020-10-16 04:53:43,998 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 108 transitions, 228 flow [2020-10-16 04:53:43,999 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 228 flow [2020-10-16 04:53:44,028 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2020-10-16 04:53:44,028 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:53:44,029 INFO L80 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 82 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-16 04:53:44,034 INFO L117 LiptonReduction]: Number of co-enabled transitions 2614 [2020-10-16 04:53:44,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:44,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:44,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:53:44,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:53:44,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:53:44,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:53:44,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:53:44,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:53:44,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:53:44,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:44,184 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:53:44,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:44,186 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:53:44,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:44,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:53:44,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:53:44,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:53:44,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:44,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:44,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:44,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:44,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:44,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:44,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:44,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:44,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:44,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:44,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:44,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:44,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:44,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:44,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:44,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:44,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:44,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:53:44,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:44,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:44,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:44,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:44,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:44,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:53:44,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:44,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:44,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:44,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:44,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:44,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:44,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:44,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:44,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:44,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:44,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:44,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:44,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:44,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:44,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:44,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:44,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:44,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:44,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:44,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:44,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:44,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:44,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:44,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:44,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:44,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:44,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:44,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:44,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:44,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:44,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:44,621 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:44,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:44,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:44,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:44,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:44,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:44,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:44,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:44,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:44,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:44,643 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:44,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:44,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:44,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:44,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:44,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:44,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:44,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:44,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:44,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:44,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:44,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:44,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:44,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:44,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:44,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:44,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:44,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:44,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:44,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:44,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:44,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:44,867 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:44,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:44,871 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:44,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:44,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:44,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:44,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:44,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:44,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:44,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:44,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:44,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:45,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:45,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:45,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:45,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:45,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:45,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:45,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:45,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:45,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:45,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:45,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:45,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:45,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:45,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:45,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:45,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:45,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:53:45,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:53:45,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:53:45,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:45,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:45,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:45,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:53:45,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:53:45,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:53:45,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:53:45,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:53:45,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:53:45,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:53:45,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:45,251 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:53:45,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:45,253 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:53:45,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:45,606 WARN L193 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 04:53:45,719 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 04:53:45,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:45,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:45,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:45,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:45,927 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:45,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:45,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:45,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:45,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:45,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:45,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:45,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:45,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:45,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:45,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:45,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:46,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:46,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:46,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:46,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:46,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:46,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:46,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:46,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:46,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:46,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:46,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:46,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:46,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:46,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:46,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:46,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:46,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:53:46,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:46,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:46,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:46,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:53:46,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:53:46,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:53:46,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:53:46,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:53:46,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:53:46,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:53:46,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:46,644 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:53:46,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:46,645 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:53:46,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:46,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:53:46,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:53:46,687 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:53:46,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:46,720 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:46,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:46,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:46,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:46,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:46,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:46,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:46,725 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:46,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:46,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:46,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:46,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:46,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:46,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:46,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:46,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:46,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:46,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:46,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:46,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:46,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:46,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:46,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:46,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:46,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:46,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:46,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:46,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:46,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:46,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:46,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:46,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:46,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:46,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:46,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:46,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:46,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:46,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:46,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:46,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:46,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:46,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:46,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:46,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:46,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:46,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:46,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:46,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:46,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:46,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:46,953 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:46,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:46,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:46,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:46,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:46,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:46,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:46,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:46,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:46,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:46,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:53:46,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:46,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:46,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:47,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:47,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:47,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:47,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:47,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:47,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:47,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:47,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:47,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:47,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:47,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:47,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:47,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:47,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:47,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:47,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:47,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:53:47,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:53:47,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:53:47,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:47,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:47,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:47,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:53:47,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:53:47,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:53:47,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:53:47,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:53:47,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:53:47,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:53:47,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:47,248 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:53:47,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:47,249 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:53:47,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:47,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:47,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:47,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:47,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:47,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:47,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:47,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:47,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:47,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:47,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:47,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:47,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:47,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:47,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:47,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:47,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:47,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:53:47,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:48,484 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2020-10-16 04:53:48,612 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-16 04:53:48,756 INFO L132 LiptonReduction]: Checked pairs total: 8106 [2020-10-16 04:53:48,756 INFO L134 LiptonReduction]: Total number of compositions: 90 [2020-10-16 04:53:48,762 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4773 [2020-10-16 04:53:48,768 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2020-10-16 04:53:48,768 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:53:48,769 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:53:48,770 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2020-10-16 04:53:48,770 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:53:48,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:53:48,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1192793, now seen corresponding path program 1 times [2020-10-16 04:53:48,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:53:48,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617312026] [2020-10-16 04:53:48,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:53:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:53:49,079 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:53:49,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617312026] [2020-10-16 04:53:49,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:53:49,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:53:49,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767714516] [2020-10-16 04:53:49,092 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:53:49,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:53:49,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:53:49,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:53:49,111 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 202 [2020-10-16 04:53:49,114 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states. [2020-10-16 04:53:49,114 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:53:49,114 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 202 [2020-10-16 04:53:49,116 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:53:49,240 INFO L129 PetriNetUnfolder]: 133/293 cut-off events. [2020-10-16 04:53:49,241 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:53:49,242 INFO L80 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 293 events. 133/293 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1600 event pairs, 29 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 501. Up to 153 conditions per place. [2020-10-16 04:53:49,246 INFO L132 encePairwiseOnDemand]: 199/202 looper letters, 11 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2020-10-16 04:53:49,246 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 33 transitions, 104 flow [2020-10-16 04:53:49,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:53:49,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:53:49,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 530 transitions. [2020-10-16 04:53:49,265 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8745874587458746 [2020-10-16 04:53:49,266 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 530 transitions. [2020-10-16 04:53:49,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 530 transitions. [2020-10-16 04:53:49,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:53:49,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 530 transitions. [2020-10-16 04:53:49,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:53:49,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:53:49,283 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:53:49,285 INFO L185 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states and 530 transitions. [2020-10-16 04:53:49,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 33 transitions, 104 flow [2020-10-16 04:53:49,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 100 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 04:53:49,291 INFO L241 Difference]: Finished difference. Result has 39 places, 28 transitions, 68 flow [2020-10-16 04:53:49,293 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2020-10-16 04:53:49,294 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2020-10-16 04:53:49,294 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2020-10-16 04:53:49,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:53:49,295 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:53:49,295 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:53:49,295 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:53:49,295 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:53:49,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:53:49,296 INFO L82 PathProgramCache]: Analyzing trace with hash 366959369, now seen corresponding path program 1 times [2020-10-16 04:53:49,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:53:49,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132596512] [2020-10-16 04:53:49,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:53:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:53:49,398 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:53:49,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132596512] [2020-10-16 04:53:49,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:53:49,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:53:49,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369887635] [2020-10-16 04:53:49,400 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:53:49,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:53:49,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:53:49,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:53:49,403 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 202 [2020-10-16 04:53:49,404 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand 4 states. [2020-10-16 04:53:49,404 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:53:49,404 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 202 [2020-10-16 04:53:49,404 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:53:49,505 INFO L129 PetriNetUnfolder]: 90/201 cut-off events. [2020-10-16 04:53:49,505 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:53:49,507 INFO L80 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 201 events. 90/201 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 930 event pairs, 46 based on Foata normal form. 16/198 useless extension candidates. Maximal degree in co-relation 357. Up to 119 conditions per place. [2020-10-16 04:53:49,508 INFO L132 encePairwiseOnDemand]: 195/202 looper letters, 6 selfloop transitions, 5 changer transitions 9/41 dead transitions. [2020-10-16 04:53:49,508 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 134 flow [2020-10-16 04:53:49,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:53:49,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:53:49,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 847 transitions. [2020-10-16 04:53:49,513 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8386138613861386 [2020-10-16 04:53:49,513 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 847 transitions. [2020-10-16 04:53:49,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 847 transitions. [2020-10-16 04:53:49,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:53:49,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 847 transitions. [2020-10-16 04:53:49,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:53:49,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:53:49,519 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:53:49,519 INFO L185 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 5 states and 847 transitions. [2020-10-16 04:53:49,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 134 flow [2020-10-16 04:53:49,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:53:49,521 INFO L241 Difference]: Finished difference. Result has 44 places, 32 transitions, 109 flow [2020-10-16 04:53:49,521 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2020-10-16 04:53:49,522 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2020-10-16 04:53:49,522 INFO L481 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 109 flow [2020-10-16 04:53:49,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:53:49,523 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:53:49,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:53:49,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:53:49,523 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:53:49,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:53:49,524 INFO L82 PathProgramCache]: Analyzing trace with hash 711282612, now seen corresponding path program 1 times [2020-10-16 04:53:49,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:53:49,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630910463] [2020-10-16 04:53:49,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:53:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:53:49,735 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:53:49,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630910463] [2020-10-16 04:53:49,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:53:49,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:53:49,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322097121] [2020-10-16 04:53:49,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:53:49,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:53:49,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:53:49,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:53:49,741 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 202 [2020-10-16 04:53:49,742 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 109 flow. Second operand 5 states. [2020-10-16 04:53:49,742 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:53:49,743 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 202 [2020-10-16 04:53:49,743 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:53:49,841 INFO L129 PetriNetUnfolder]: 66/160 cut-off events. [2020-10-16 04:53:49,841 INFO L130 PetriNetUnfolder]: For 103/127 co-relation queries the response was YES. [2020-10-16 04:53:49,843 INFO L80 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 160 events. 66/160 cut-off events. For 103/127 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 634 event pairs, 14 based on Foata normal form. 22/167 useless extension candidates. Maximal degree in co-relation 503. Up to 108 conditions per place. [2020-10-16 04:53:49,844 INFO L132 encePairwiseOnDemand]: 195/202 looper letters, 6 selfloop transitions, 9 changer transitions 9/45 dead transitions. [2020-10-16 04:53:49,844 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 233 flow [2020-10-16 04:53:49,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:53:49,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:53:49,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1016 transitions. [2020-10-16 04:53:49,849 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8382838283828383 [2020-10-16 04:53:49,849 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1016 transitions. [2020-10-16 04:53:49,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1016 transitions. [2020-10-16 04:53:49,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:53:49,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1016 transitions. [2020-10-16 04:53:49,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:53:49,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:53:49,855 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:53:49,855 INFO L185 Difference]: Start difference. First operand has 44 places, 32 transitions, 109 flow. Second operand 6 states and 1016 transitions. [2020-10-16 04:53:49,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 233 flow [2020-10-16 04:53:49,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 45 transitions, 226 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 04:53:49,859 INFO L241 Difference]: Finished difference. Result has 48 places, 36 transitions, 174 flow [2020-10-16 04:53:49,860 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2020-10-16 04:53:49,860 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2020-10-16 04:53:49,860 INFO L481 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 174 flow [2020-10-16 04:53:49,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:53:49,861 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:53:49,861 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:53:49,861 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:53:49,861 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:53:49,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:53:49,862 INFO L82 PathProgramCache]: Analyzing trace with hash 350758430, now seen corresponding path program 1 times [2020-10-16 04:53:49,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:53:49,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830089098] [2020-10-16 04:53:49,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:53:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:53:50,030 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:53:50,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830089098] [2020-10-16 04:53:50,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:53:50,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:53:50,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165327428] [2020-10-16 04:53:50,032 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:53:50,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:53:50,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:53:50,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:53:50,035 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 202 [2020-10-16 04:53:50,036 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 174 flow. Second operand 6 states. [2020-10-16 04:53:50,037 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:53:50,037 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 202 [2020-10-16 04:53:50,037 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:53:50,191 INFO L129 PetriNetUnfolder]: 36/102 cut-off events. [2020-10-16 04:53:50,191 INFO L130 PetriNetUnfolder]: For 199/253 co-relation queries the response was YES. [2020-10-16 04:53:50,192 INFO L80 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 102 events. 36/102 cut-off events. For 199/253 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 297 event pairs, 2 based on Foata normal form. 25/119 useless extension candidates. Maximal degree in co-relation 431. Up to 68 conditions per place. [2020-10-16 04:53:50,193 INFO L132 encePairwiseOnDemand]: 195/202 looper letters, 6 selfloop transitions, 13 changer transitions 9/49 dead transitions. [2020-10-16 04:53:50,194 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 356 flow [2020-10-16 04:53:50,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:53:50,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:53:50,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1185 transitions. [2020-10-16 04:53:50,198 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8380480905233381 [2020-10-16 04:53:50,198 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1185 transitions. [2020-10-16 04:53:50,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1185 transitions. [2020-10-16 04:53:50,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:53:50,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1185 transitions. [2020-10-16 04:53:50,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:53:50,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:53:50,205 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:53:50,205 INFO L185 Difference]: Start difference. First operand has 48 places, 36 transitions, 174 flow. Second operand 7 states and 1185 transitions. [2020-10-16 04:53:50,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 356 flow [2020-10-16 04:53:50,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 49 transitions, 294 flow, removed 26 selfloop flow, removed 4 redundant places. [2020-10-16 04:53:50,214 INFO L241 Difference]: Finished difference. Result has 51 places, 40 transitions, 224 flow [2020-10-16 04:53:50,214 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=224, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2020-10-16 04:53:50,215 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2020-10-16 04:53:50,215 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 224 flow [2020-10-16 04:53:50,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:53:50,215 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:53:50,215 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] [2020-10-16 04:53:50,215 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:53:50,216 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:53:50,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:53:50,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1317023685, now seen corresponding path program 1 times [2020-10-16 04:53:50,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:53:50,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576242550] [2020-10-16 04:53:50,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:53:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:53:50,426 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:53:50,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576242550] [2020-10-16 04:53:50,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:53:50,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:53:50,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082601170] [2020-10-16 04:53:50,428 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:53:50,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:53:50,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:53:50,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:53:50,431 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 202 [2020-10-16 04:53:50,432 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 224 flow. Second operand 7 states. [2020-10-16 04:53:50,432 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:53:50,432 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 202 [2020-10-16 04:53:50,432 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:53:50,559 INFO L129 PetriNetUnfolder]: 20/64 cut-off events. [2020-10-16 04:53:50,559 INFO L130 PetriNetUnfolder]: For 157/211 co-relation queries the response was YES. [2020-10-16 04:53:50,559 INFO L80 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 64 events. 20/64 cut-off events. For 157/211 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 0 based on Foata normal form. 19/79 useless extension candidates. Maximal degree in co-relation 264. Up to 38 conditions per place. [2020-10-16 04:53:50,560 INFO L132 encePairwiseOnDemand]: 195/202 looper letters, 2 selfloop transitions, 17 changer transitions 6/45 dead transitions. [2020-10-16 04:53:50,560 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 45 transitions, 328 flow [2020-10-16 04:53:50,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:53:50,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:53:50,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1346 transitions. [2020-10-16 04:53:50,566 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8329207920792079 [2020-10-16 04:53:50,566 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1346 transitions. [2020-10-16 04:53:50,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1346 transitions. [2020-10-16 04:53:50,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:53:50,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1346 transitions. [2020-10-16 04:53:50,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:53:50,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:53:50,578 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:53:50,578 INFO L185 Difference]: Start difference. First operand has 51 places, 40 transitions, 224 flow. Second operand 8 states and 1346 transitions. [2020-10-16 04:53:50,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 45 transitions, 328 flow [2020-10-16 04:53:50,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 45 transitions, 266 flow, removed 22 selfloop flow, removed 5 redundant places. [2020-10-16 04:53:50,585 INFO L241 Difference]: Finished difference. Result has 54 places, 39 transitions, 216 flow [2020-10-16 04:53:50,585 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=216, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2020-10-16 04:53:50,585 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2020-10-16 04:53:50,585 INFO L481 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 216 flow [2020-10-16 04:53:50,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:53:50,586 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:53:50,586 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] [2020-10-16 04:53:50,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:53:50,586 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:53:50,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:53:50,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1628212793, now seen corresponding path program 1 times [2020-10-16 04:53:50,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:53:50,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476452713] [2020-10-16 04:53:50,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:53:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:53:50,726 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:53:50,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476452713] [2020-10-16 04:53:50,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:53:50,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:53:50,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826863834] [2020-10-16 04:53:50,728 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:53:50,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:53:50,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:53:50,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:53:50,730 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 202 [2020-10-16 04:53:50,731 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 216 flow. Second operand 4 states. [2020-10-16 04:53:50,731 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:53:50,731 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 202 [2020-10-16 04:53:50,731 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:53:50,765 INFO L129 PetriNetUnfolder]: 33/90 cut-off events. [2020-10-16 04:53:50,766 INFO L130 PetriNetUnfolder]: For 140/168 co-relation queries the response was YES. [2020-10-16 04:53:50,767 INFO L80 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 90 events. 33/90 cut-off events. For 140/168 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 247 event pairs, 0 based on Foata normal form. 2/79 useless extension candidates. Maximal degree in co-relation 293. Up to 35 conditions per place. [2020-10-16 04:53:50,768 INFO L132 encePairwiseOnDemand]: 199/202 looper letters, 3 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2020-10-16 04:53:50,768 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 40 transitions, 228 flow [2020-10-16 04:53:50,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:53:50,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:53:50,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 682 transitions. [2020-10-16 04:53:50,771 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.844059405940594 [2020-10-16 04:53:50,771 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 682 transitions. [2020-10-16 04:53:50,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 682 transitions. [2020-10-16 04:53:50,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:53:50,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 682 transitions. [2020-10-16 04:53:50,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:53:50,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:53:50,776 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:53:50,776 INFO L185 Difference]: Start difference. First operand has 54 places, 39 transitions, 216 flow. Second operand 4 states and 682 transitions. [2020-10-16 04:53:50,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 40 transitions, 228 flow [2020-10-16 04:53:50,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 40 transitions, 164 flow, removed 19 selfloop flow, removed 7 redundant places. [2020-10-16 04:53:50,780 INFO L241 Difference]: Finished difference. Result has 49 places, 40 transitions, 165 flow [2020-10-16 04:53:50,780 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2020-10-16 04:53:50,780 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2020-10-16 04:53:50,780 INFO L481 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 165 flow [2020-10-16 04:53:50,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:53:50,781 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:53:50,781 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] [2020-10-16 04:53:50,781 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:53:50,781 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:53:50,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:53:50,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1531159339, now seen corresponding path program 2 times [2020-10-16 04:53:50,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:53:50,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84396464] [2020-10-16 04:53:50,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:53:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:53:50,884 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:53:50,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84396464] [2020-10-16 04:53:50,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:53:50,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:53:50,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889429123] [2020-10-16 04:53:50,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:53:50,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:53:50,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:53:50,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:53:50,888 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 202 [2020-10-16 04:53:50,888 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 165 flow. Second operand 4 states. [2020-10-16 04:53:50,888 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:53:50,888 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 202 [2020-10-16 04:53:50,889 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:53:50,936 INFO L129 PetriNetUnfolder]: 64/151 cut-off events. [2020-10-16 04:53:50,937 INFO L130 PetriNetUnfolder]: For 127/132 co-relation queries the response was YES. [2020-10-16 04:53:50,938 INFO L80 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 151 events. 64/151 cut-off events. For 127/132 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 550 event pairs, 0 based on Foata normal form. 2/126 useless extension candidates. Maximal degree in co-relation 390. Up to 53 conditions per place. [2020-10-16 04:53:50,939 INFO L132 encePairwiseOnDemand]: 199/202 looper letters, 3 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2020-10-16 04:53:50,939 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 41 transitions, 177 flow [2020-10-16 04:53:50,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:53:50,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:53:50,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 686 transitions. [2020-10-16 04:53:50,942 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.849009900990099 [2020-10-16 04:53:50,942 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 686 transitions. [2020-10-16 04:53:50,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 686 transitions. [2020-10-16 04:53:50,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:53:50,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 686 transitions. [2020-10-16 04:53:50,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:53:50,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:53:50,947 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:53:50,947 INFO L185 Difference]: Start difference. First operand has 49 places, 40 transitions, 165 flow. Second operand 4 states and 686 transitions. [2020-10-16 04:53:50,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 41 transitions, 177 flow [2020-10-16 04:53:50,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 41 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:53:50,956 INFO L241 Difference]: Finished difference. Result has 53 places, 41 transitions, 177 flow [2020-10-16 04:53:50,956 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2020-10-16 04:53:50,956 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places. [2020-10-16 04:53:50,957 INFO L481 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 177 flow [2020-10-16 04:53:50,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:53:50,957 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:53:50,957 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] [2020-10-16 04:53:50,957 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:53:50,957 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:53:50,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:53:50,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1747538325, now seen corresponding path program 3 times [2020-10-16 04:53:50,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:53:50,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27036094] [2020-10-16 04:53:50,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:53:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:53:51,043 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:53:51,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27036094] [2020-10-16 04:53:51,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:53:51,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:53:51,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333327113] [2020-10-16 04:53:51,045 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:53:51,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:53:51,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:53:51,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:53:51,048 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 202 [2020-10-16 04:53:51,048 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 177 flow. Second operand 4 states. [2020-10-16 04:53:51,048 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:53:51,049 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 202 [2020-10-16 04:53:51,049 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:53:51,104 INFO L129 PetriNetUnfolder]: 128/291 cut-off events. [2020-10-16 04:53:51,104 INFO L130 PetriNetUnfolder]: For 256/266 co-relation queries the response was YES. [2020-10-16 04:53:51,106 INFO L80 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 291 events. 128/291 cut-off events. For 256/266 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 1430 event pairs, 0 based on Foata normal form. 2/243 useless extension candidates. Maximal degree in co-relation 771. Up to 105 conditions per place. [2020-10-16 04:53:51,109 INFO L132 encePairwiseOnDemand]: 199/202 looper letters, 3 selfloop transitions, 1 changer transitions 2/42 dead transitions. [2020-10-16 04:53:51,109 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 42 transitions, 189 flow [2020-10-16 04:53:51,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:53:51,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:53:51,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 686 transitions. [2020-10-16 04:53:51,112 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.849009900990099 [2020-10-16 04:53:51,112 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 686 transitions. [2020-10-16 04:53:51,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 686 transitions. [2020-10-16 04:53:51,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:53:51,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 686 transitions. [2020-10-16 04:53:51,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:53:51,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:53:51,116 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:53:51,116 INFO L185 Difference]: Start difference. First operand has 53 places, 41 transitions, 177 flow. Second operand 4 states and 686 transitions. [2020-10-16 04:53:51,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 42 transitions, 189 flow [2020-10-16 04:53:51,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 42 transitions, 188 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:53:51,123 INFO L241 Difference]: Finished difference. Result has 57 places, 40 transitions, 177 flow [2020-10-16 04:53:51,123 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2020-10-16 04:53:51,124 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2020-10-16 04:53:51,124 INFO L481 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 177 flow [2020-10-16 04:53:51,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:53:51,124 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:53:51,124 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] [2020-10-16 04:53:51,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:53:51,125 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:53:51,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:53:51,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1404519441, now seen corresponding path program 4 times [2020-10-16 04:53:51,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:53:51,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291916378] [2020-10-16 04:53:51,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:53:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:53:51,426 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:53:51,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291916378] [2020-10-16 04:53:51,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:53:51,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:53:51,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378001893] [2020-10-16 04:53:51,427 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 04:53:51,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:53:51,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 04:53:51,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 04:53:51,430 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 202 [2020-10-16 04:53:51,431 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 40 transitions, 177 flow. Second operand 8 states. [2020-10-16 04:53:51,431 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:53:51,431 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 202 [2020-10-16 04:53:51,432 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:53:51,869 INFO L129 PetriNetUnfolder]: 413/940 cut-off events. [2020-10-16 04:53:51,869 INFO L130 PetriNetUnfolder]: For 578/608 co-relation queries the response was YES. [2020-10-16 04:53:51,875 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2445 conditions, 940 events. 413/940 cut-off events. For 578/608 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 6558 event pairs, 45 based on Foata normal form. 2/865 useless extension candidates. Maximal degree in co-relation 2427. Up to 271 conditions per place. [2020-10-16 04:53:51,878 INFO L132 encePairwiseOnDemand]: 193/202 looper letters, 13 selfloop transitions, 11 changer transitions 1/56 dead transitions. [2020-10-16 04:53:51,879 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 56 transitions, 259 flow [2020-10-16 04:53:51,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:53:51,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:53:51,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1034 transitions. [2020-10-16 04:53:51,883 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7312588401697313 [2020-10-16 04:53:51,883 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1034 transitions. [2020-10-16 04:53:51,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1034 transitions. [2020-10-16 04:53:51,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:53:51,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1034 transitions. [2020-10-16 04:53:51,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:53:51,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:53:51,889 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:53:51,889 INFO L185 Difference]: Start difference. First operand has 57 places, 40 transitions, 177 flow. Second operand 7 states and 1034 transitions. [2020-10-16 04:53:51,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 56 transitions, 259 flow [2020-10-16 04:53:51,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 56 transitions, 254 flow, removed 2 selfloop flow, removed 3 redundant places. [2020-10-16 04:53:51,917 INFO L241 Difference]: Finished difference. Result has 61 places, 48 transitions, 241 flow [2020-10-16 04:53:51,917 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=241, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2020-10-16 04:53:51,917 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2020-10-16 04:53:51,917 INFO L481 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 241 flow [2020-10-16 04:53:51,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 04:53:51,917 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:53:51,918 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] [2020-10-16 04:53:51,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:53:51,918 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:53:51,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:53:51,918 INFO L82 PathProgramCache]: Analyzing trace with hash -60219283, now seen corresponding path program 5 times [2020-10-16 04:53:51,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:53:51,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037334409] [2020-10-16 04:53:51,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:53:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:53:52,229 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:53:52,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037334409] [2020-10-16 04:53:52,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:53:52,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:53:52,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437085546] [2020-10-16 04:53:52,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 04:53:52,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:53:52,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 04:53:52,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-16 04:53:52,232 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 202 [2020-10-16 04:53:52,233 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 241 flow. Second operand 8 states. [2020-10-16 04:53:52,233 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:53:52,233 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 202 [2020-10-16 04:53:52,233 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:53:52,689 INFO L129 PetriNetUnfolder]: 632/1449 cut-off events. [2020-10-16 04:53:52,689 INFO L130 PetriNetUnfolder]: For 1398/2056 co-relation queries the response was YES. [2020-10-16 04:53:52,699 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4601 conditions, 1449 events. 632/1449 cut-off events. For 1398/2056 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 11277 event pairs, 28 based on Foata normal form. 25/1351 useless extension candidates. Maximal degree in co-relation 4580. Up to 481 conditions per place. [2020-10-16 04:53:52,705 INFO L132 encePairwiseOnDemand]: 195/202 looper letters, 25 selfloop transitions, 5 changer transitions 13/74 dead transitions. [2020-10-16 04:53:52,705 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 74 transitions, 469 flow [2020-10-16 04:53:52,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:53:52,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:53:52,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 881 transitions. [2020-10-16 04:53:52,710 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.726897689768977 [2020-10-16 04:53:52,710 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 881 transitions. [2020-10-16 04:53:52,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 881 transitions. [2020-10-16 04:53:52,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:53:52,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 881 transitions. [2020-10-16 04:53:52,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:53:52,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:53:52,716 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:53:52,716 INFO L185 Difference]: Start difference. First operand has 61 places, 48 transitions, 241 flow. Second operand 6 states and 881 transitions. [2020-10-16 04:53:52,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 74 transitions, 469 flow [2020-10-16 04:53:52,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 74 transitions, 456 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 04:53:52,761 INFO L241 Difference]: Finished difference. Result has 66 places, 51 transitions, 275 flow [2020-10-16 04:53:52,761 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=66, PETRI_TRANSITIONS=51} [2020-10-16 04:53:52,761 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2020-10-16 04:53:52,762 INFO L481 AbstractCegarLoop]: Abstraction has has 66 places, 51 transitions, 275 flow [2020-10-16 04:53:52,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 04:53:52,762 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:53:52,762 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] [2020-10-16 04:53:52,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:53:52,762 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:53:52,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:53:52,763 INFO L82 PathProgramCache]: Analyzing trace with hash -823664599, now seen corresponding path program 6 times [2020-10-16 04:53:52,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:53:52,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859002567] [2020-10-16 04:53:52,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:53:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:53:52,816 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:53:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:53:52,881 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:53:52,919 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 04:53:52,919 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 04:53:52,919 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 04:53:52,921 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 04:53:52,940 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1151] [1151] L3-->L870: Formula: (let ((.cse9 (= (mod ~a$r_buff1_thd0~0_In-1303254215 256) 0)) (.cse8 (= (mod ~a$w_buff1_used~0_In-1303254215 256) 0)) (.cse7 (= (mod ~a$r_buff0_thd0~0_In-1303254215 256) 0)) (.cse6 (= (mod ~a$w_buff0_used~0_In-1303254215 256) 0))) (let ((.cse0 (or .cse7 .cse6)) (.cse5 (or .cse9 .cse8)) (.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse1 (not .cse7)) (.cse2 (not .cse6))) (and (or (and .cse0 (= ~a$w_buff0_used~0_In-1303254215 ~a$w_buff0_used~0_Out-1303254215)) (and (= ~a$w_buff0_used~0_Out-1303254215 0) .cse1 .cse2)) (= ~a$r_buff0_thd0~0_Out-1303254215 ~a$r_buff0_thd0~0_In-1303254215) (or (and (= ~a$w_buff1_used~0_Out-1303254215 0) .cse3 .cse4) (and .cse5 (= ~a$w_buff1_used~0_Out-1303254215 ~a$w_buff1_used~0_In-1303254215))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In-1303254215 0)) (= ~a$r_buff1_thd0~0_In-1303254215 ~a$r_buff1_thd0~0_Out-1303254215) (or (and .cse0 (or (and (= ~a~0_Out-1303254215 ~a~0_In-1303254215) .cse5) (and .cse3 .cse4 (= ~a$w_buff1~0_In-1303254215 ~a~0_Out-1303254215)))) (and .cse1 (= ~a$w_buff0~0_In-1303254215 ~a~0_Out-1303254215) .cse2))))) InVars {~a~0=~a~0_In-1303254215, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-1303254215, ~a$w_buff1~0=~a$w_buff1~0_In-1303254215, ~a$w_buff0~0=~a$w_buff0~0_In-1303254215, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1303254215, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1303254215, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1303254215, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1303254215} OutVars{ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-1303254215|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-1303254215, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-1303254215|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_Out-1303254215, ULTIMATE.start_main_#t~ite54=|ULTIMATE.start_main_#t~ite54_Out-1303254215|, ULTIMATE.start_main_#t~ite53=|ULTIMATE.start_main_#t~ite53_Out-1303254215|, ULTIMATE.start_main_#t~ite56=|ULTIMATE.start_main_#t~ite56_Out-1303254215|, ULTIMATE.start_main_#t~ite55=|ULTIMATE.start_main_#t~ite55_Out-1303254215|, ~a~0=~a~0_Out-1303254215, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-1303254215, ~a$w_buff1~0=~a$w_buff1~0_In-1303254215, ~a$w_buff0~0=~a$w_buff0~0_In-1303254215, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-1303254215, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-1303254215} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite58, ~a$r_buff1_thd0~0, ~a$w_buff0_used~0, ULTIMATE.start_main_#t~ite57, ~a$r_buff0_thd0~0, ~a$w_buff1_used~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite55] because there is no mapped edge [2020-10-16 04:53:52,944 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:53:52,944 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,949 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:53:52,949 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,949 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:53:52,949 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,950 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:53:52,950 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,950 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:53:52,950 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,950 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:53:52,950 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,951 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:53:52,951 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,951 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:53:52,951 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,951 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:53:52,951 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,952 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:53:52,952 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,952 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:53:52,952 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,952 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:53:52,952 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,953 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:53:52,953 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,953 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:53:52,953 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,954 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:53:52,954 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,954 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:53:52,954 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,954 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:53:52,954 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,955 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:53:52,955 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,955 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:53:52,955 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,955 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:53:52,955 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,956 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:53:52,956 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,956 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:53:52,956 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,956 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:53:52,956 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,956 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:53:52,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,957 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:53:52,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,957 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:53:52,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,957 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:53:52,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,958 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:53:52,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,958 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:53:52,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,959 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:53:52,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,959 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:53:52,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,959 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:53:52,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,959 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:53:52,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,960 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:53:52,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:52,960 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:53:52,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:53,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:53:53 BasicIcfg [2020-10-16 04:53:53,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:53:53,072 INFO L168 Benchmark]: Toolchain (without parser) took 12661.85 ms. Allocated memory was 247.5 MB in the beginning and 592.4 MB in the end (delta: 345.0 MB). Free memory was 203.1 MB in the beginning and 303.7 MB in the end (delta: -100.6 MB). Peak memory consumption was 244.4 MB. Max. memory is 14.2 GB. [2020-10-16 04:53:53,073 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 247.5 MB. Free memory was 225.5 MB in the beginning and 224.7 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. [2020-10-16 04:53:53,074 INFO L168 Benchmark]: CACSL2BoogieTranslator took 759.22 ms. Allocated memory was 247.5 MB in the beginning and 304.1 MB in the end (delta: 56.6 MB). Free memory was 203.1 MB in the beginning and 253.9 MB in the end (delta: -50.8 MB). Peak memory consumption was 31.4 MB. Max. memory is 14.2 GB. [2020-10-16 04:53:53,076 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.18 ms. Allocated memory is still 304.1 MB. Free memory was 253.9 MB in the beginning and 250.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. [2020-10-16 04:53:53,078 INFO L168 Benchmark]: Boogie Preprocessor took 54.01 ms. Allocated memory is still 304.1 MB. Free memory was 250.6 MB in the beginning and 248.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:53:53,079 INFO L168 Benchmark]: RCFGBuilder took 2416.64 ms. Allocated memory was 304.1 MB in the beginning and 352.8 MB in the end (delta: 48.8 MB). Free memory was 248.1 MB in the beginning and 156.3 MB in the end (delta: 91.7 MB). Peak memory consumption was 140.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:53:53,082 INFO L168 Benchmark]: TraceAbstraction took 9361.30 ms. Allocated memory was 352.8 MB in the beginning and 592.4 MB in the end (delta: 239.6 MB). Free memory was 156.3 MB in the beginning and 303.7 MB in the end (delta: -147.4 MB). Peak memory consumption was 92.2 MB. Max. memory is 14.2 GB. [2020-10-16 04:53:53,089 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.27 ms. Allocated memory is still 247.5 MB. Free memory was 225.5 MB in the beginning and 224.7 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 759.22 ms. Allocated memory was 247.5 MB in the beginning and 304.1 MB in the end (delta: 56.6 MB). Free memory was 203.1 MB in the beginning and 253.9 MB in the end (delta: -50.8 MB). Peak memory consumption was 31.4 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 65.18 ms. Allocated memory is still 304.1 MB. Free memory was 253.9 MB in the beginning and 250.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 54.01 ms. Allocated memory is still 304.1 MB. Free memory was 250.6 MB in the beginning and 248.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2416.64 ms. Allocated memory was 304.1 MB in the beginning and 352.8 MB in the end (delta: 48.8 MB). Free memory was 248.1 MB in the beginning and 156.3 MB in the end (delta: 91.7 MB). Peak memory consumption was 140.5 MB. Max. memory is 14.2 GB. * TraceAbstraction took 9361.30 ms. Allocated memory was 352.8 MB in the beginning and 592.4 MB in the end (delta: 239.6 MB). Free memory was 156.3 MB in the beginning and 303.7 MB in the end (delta: -147.4 MB). Peak memory consumption was 92.2 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1756 VarBasedMoverChecksPositive, 88 VarBasedMoverChecksNegative, 12 SemBasedMoverChecksPositive, 76 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 254 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.7s, 119 PlacesBefore, 42 PlacesAfterwards, 108 TransitionsBefore, 29 TransitionsAfterwards, 2614 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 90 TotalNumberOfCompositions, 8106 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p1_EAX = 0; [L705] 0 int __unbuffered_p2_EAX = 0; [L707] 0 int __unbuffered_p3_EAX = 0; [L709] 0 int a = 0; [L710] 0 _Bool a$flush_delayed; [L711] 0 int a$mem_tmp; [L712] 0 _Bool a$r_buff0_thd0; [L713] 0 _Bool a$r_buff0_thd1; [L714] 0 _Bool a$r_buff0_thd2; [L715] 0 _Bool a$r_buff0_thd3; [L716] 0 _Bool a$r_buff0_thd4; [L717] 0 _Bool a$r_buff1_thd0; [L718] 0 _Bool a$r_buff1_thd1; [L719] 0 _Bool a$r_buff1_thd2; [L720] 0 _Bool a$r_buff1_thd3; [L721] 0 _Bool a$r_buff1_thd4; [L722] 0 _Bool a$read_delayed; [L723] 0 int *a$read_delayed_var; [L724] 0 int a$w_buff0; [L725] 0 _Bool a$w_buff0_used; [L726] 0 int a$w_buff1; [L727] 0 _Bool a$w_buff1_used; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L852] 0 pthread_t t1333; [L853] FCALL, FORK 0 pthread_create(&t1333, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L741] 1 a$w_buff1 = a$w_buff0 [L742] 1 a$w_buff0 = 1 [L743] 1 a$w_buff1_used = a$w_buff0_used [L744] 1 a$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L746] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L747] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L748] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L749] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L750] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L751] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L854] 0 pthread_t t1334; [L855] FCALL, FORK 0 pthread_create(&t1334, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L856] 0 pthread_t t1335; [L857] FCALL, FORK 0 pthread_create(&t1335, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L858] 0 pthread_t t1336; [L859] FCALL, FORK 0 pthread_create(&t1336, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L791] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L811] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L814] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 4 a$flush_delayed = weak$$choice2 [L817] 4 a$mem_tmp = a [L818] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L818] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1 [L818] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L818] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L819] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L819] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L820] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L820] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L820] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L820] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L821] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L821] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L822] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L822] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L822] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L823] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L823] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L824] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L824] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L824] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L825] 4 __unbuffered_p3_EAX = a [L826] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L826] 4 a = a$flush_delayed ? a$mem_tmp : a [L827] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=12, weak$$choice2=255, x=1, y=1, z=1] [L830] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L830] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L830] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L830] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L831] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L831] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L832] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L832] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L833] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L833] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L834] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L834] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L757] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L757] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L758] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L758] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L759] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L759] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L760] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L760] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L761] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L761] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L777] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L777] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L778] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L778] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L779] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L780] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L780] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L781] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L781] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L797] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L797] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L797] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L797] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L798] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L798] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L799] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L799] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L800] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L800] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L801] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L801] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L784] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 2 return 0; [L804] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 3 return 0; [L837] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 4 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L872] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=12, weak$$choice2=255, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 111 locations, 2 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: 9.0s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 32 SDtfs, 26 SDslu, 28 SDs, 0 SdLazy, 369 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=275occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 233 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 196 ConstructedInterpolants, 0 QuantifiedInterpolants, 26566 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...