/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/safe020_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 05:06:38,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 05:06:38,496 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 05:06:38,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 05:06:38,537 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 05:06:38,545 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 05:06:38,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 05:06:38,552 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 05:06:38,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 05:06:38,558 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 05:06:38,559 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 05:06:38,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 05:06:38,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 05:06:38,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 05:06:38,565 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 05:06:38,566 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 05:06:38,568 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 05:06:38,569 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 05:06:38,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 05:06:38,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 05:06:38,580 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 05:06:38,581 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 05:06:38,582 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 05:06:38,583 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 05:06:38,592 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 05:06:38,592 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 05:06:38,593 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 05:06:38,597 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 05:06:38,597 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 05:06:38,601 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 05:06:38,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 05:06:38,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 05:06:38,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 05:06:38,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 05:06:38,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 05:06:38,604 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 05:06:38,605 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 05:06:38,605 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 05:06:38,605 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 05:06:38,606 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 05:06:38,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 05:06:38,607 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 05:06:38,628 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 05:06:38,629 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 05:06:38,630 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 05:06:38,630 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 05:06:38,630 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 05:06:38,630 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 05:06:38,631 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 05:06:38,631 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 05:06:38,631 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 05:06:38,631 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 05:06:38,631 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 05:06:38,631 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 05:06:38,632 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 05:06:38,632 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 05:06:38,632 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 05:06:38,632 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 05:06:38,632 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 05:06:38,633 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 05:06:38,633 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 05:06:38,633 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 05:06:38,633 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 05:06:38,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 05:06:38,634 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 05:06:38,634 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 05:06:38,634 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 05:06:38,634 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 05:06:38,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 05:06:38,635 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 05:06:38,635 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 05:06:38,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 05:06:38,959 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 05:06:38,964 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 05:06:38,966 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 05:06:38,966 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 05:06:38,967 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe020_rmo.oepc.i [2020-10-16 05:06:39,032 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/120355012/64be4c5afb354404a8250d60b49e34df/FLAG72a9ec51d [2020-10-16 05:06:39,665 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 05:06:39,665 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe020_rmo.oepc.i [2020-10-16 05:06:39,682 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/120355012/64be4c5afb354404a8250d60b49e34df/FLAG72a9ec51d [2020-10-16 05:06:39,906 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/120355012/64be4c5afb354404a8250d60b49e34df [2020-10-16 05:06:39,914 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 05:06:39,916 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 05:06:39,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 05:06:39,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 05:06:39,922 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 05:06:39,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:06:39" (1/1) ... [2020-10-16 05:06:39,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b6f427d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:06:39, skipping insertion in model container [2020-10-16 05:06:39,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:06:39" (1/1) ... [2020-10-16 05:06:39,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 05:06:40,009 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 05:06:40,484 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:06:40,498 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 05:06:40,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:06:40,678 INFO L208 MainTranslator]: Completed translation [2020-10-16 05:06:40,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:06:40 WrapperNode [2020-10-16 05:06:40,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 05:06:40,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 05:06:40,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 05:06:40,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 05:06:40,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:06:40" (1/1) ... [2020-10-16 05:06:40,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:06:40" (1/1) ... [2020-10-16 05:06:40,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 05:06:40,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 05:06:40,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 05:06:40,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 05:06:40,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:06:40" (1/1) ... [2020-10-16 05:06:40,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:06:40" (1/1) ... [2020-10-16 05:06:40,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:06:40" (1/1) ... [2020-10-16 05:06:40,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:06:40" (1/1) ... [2020-10-16 05:06:40,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:06:40" (1/1) ... [2020-10-16 05:06:40,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:06:40" (1/1) ... [2020-10-16 05:06:40,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:06:40" (1/1) ... [2020-10-16 05:06:40,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 05:06:40,791 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 05:06:40,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 05:06:40,791 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 05:06:40,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:06:40" (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 05:06:40,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-16 05:06:40,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 05:06:40,888 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 05:06:40,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 05:06:40,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 05:06:40,889 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 05:06:40,889 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 05:06:40,889 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 05:06:40,889 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 05:06:40,890 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 05:06:40,890 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 05:06:40,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-16 05:06:40,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 05:06:40,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 05:06:40,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 05:06:40,893 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 05:06:43,868 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 05:06:43,869 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-16 05:06:43,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:06:43 BoogieIcfgContainer [2020-10-16 05:06:43,872 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 05:06:43,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 05:06:43,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 05:06:43,879 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 05:06:43,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 05:06:39" (1/3) ... [2020-10-16 05:06:43,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0c1d0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:06:43, skipping insertion in model container [2020-10-16 05:06:43,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:06:40" (2/3) ... [2020-10-16 05:06:43,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0c1d0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:06:43, skipping insertion in model container [2020-10-16 05:06:43,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:06:43" (3/3) ... [2020-10-16 05:06:43,884 INFO L111 eAbstractionObserver]: Analyzing ICFG safe020_rmo.oepc.i [2020-10-16 05:06:43,902 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 05:06:43,912 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-16 05:06:43,913 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 05:06:43,962 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,962 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,963 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,963 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,963 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,964 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,964 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,964 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,965 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,966 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,967 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,968 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,969 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,970 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,970 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,970 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,970 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,973 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,974 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,978 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,979 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,980 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,980 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,980 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,980 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,982 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,982 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,983 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,983 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:43,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,006 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,007 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,009 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,009 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,009 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,010 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,012 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,012 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,012 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,012 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,013 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,013 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,013 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,014 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,014 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,014 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,014 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,015 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,017 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,018 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,018 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,018 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,018 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,019 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,019 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,019 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,019 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,019 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,020 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,020 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,020 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,020 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,020 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,020 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,022 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,022 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,022 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,022 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,022 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,022 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,023 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,023 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,023 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,023 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,023 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,025 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,025 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,026 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,026 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,026 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,026 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,026 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,027 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,027 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,027 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,027 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:06:44,052 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-10-16 05:06:44,084 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 05:06:44,084 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 05:06:44,085 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 05:06:44,085 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 05:06:44,085 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 05:06:44,085 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 05:06:44,086 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 05:06:44,086 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 05:06:44,105 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2020-10-16 05:06:44,167 INFO L129 PetriNetUnfolder]: 2/104 cut-off events. [2020-10-16 05:06:44,167 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:06:44,172 INFO L80 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2020-10-16 05:06:44,173 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2020-10-16 05:06:44,182 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 93 transitions, 195 flow [2020-10-16 05:06:44,185 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 05:06:44,189 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 93 transitions, 195 flow [2020-10-16 05:06:44,193 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 93 transitions, 195 flow [2020-10-16 05:06:44,194 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 102 places, 93 transitions, 195 flow [2020-10-16 05:06:44,222 INFO L129 PetriNetUnfolder]: 1/93 cut-off events. [2020-10-16 05:06:44,223 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:06:44,224 INFO L80 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 1/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2020-10-16 05:06:44,227 INFO L117 LiptonReduction]: Number of co-enabled transitions 954 [2020-10-16 05:06:44,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:44,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:44,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:44,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:44,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:06:44,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:44,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 2, 1] term [2020-10-16 05:06:44,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:44,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 6, 3, 3, 2, 1] term [2020-10-16 05:06:44,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:44,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 2, 2, 2, 1] term [2020-10-16 05:06:44,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:44,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 05:06:44,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:44,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 05:06:44,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:44,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 05:06:44,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:44,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:44,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:44,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 1] term [2020-10-16 05:06:44,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:44,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-10-16 05:06:44,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:44,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:44,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:44,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:44,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:44,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:06:44,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:44,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:44,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:44,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:06:44,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:44,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:44,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:45,207 WARN L193 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2020-10-16 05:06:45,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:06:45,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:45,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:45,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:45,336 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-16 05:06:45,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:45,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:45,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:45,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:45,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:45,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:45,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:45,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:46,874 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 238 DAG size of output: 197 [2020-10-16 05:06:46,885 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:46,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:47,541 WARN L193 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-10-16 05:06:47,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:47,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:47,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:47,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:47,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:47,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:47,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:47,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 2, 1] term [2020-10-16 05:06:47,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:47,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:06:47,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:47,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:06:47,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:47,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:06:47,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:47,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:06:47,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:47,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:47,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:47,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:47,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:47,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:47,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:47,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:47,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 1] term [2020-10-16 05:06:47,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:06:47,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-10-16 05:06:47,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:47,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:06:47,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:47,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:47,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:48,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:48,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:48,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 1] term [2020-10-16 05:06:48,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:06:48,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-10-16 05:06:48,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:48,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:48,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:48,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:48,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:48,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 2, 1] term [2020-10-16 05:06:48,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:48,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:06:48,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:48,095 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:06:48,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:48,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:06:48,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:48,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:06:48,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:48,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:48,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:48,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:48,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:48,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:48,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:48,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:48,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:48,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:48,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:48,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:48,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:48,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:48,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:48,645 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-10-16 05:06:48,752 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-10-16 05:06:48,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:48,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:48,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:48,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:48,977 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 05:06:48,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:48,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:06:48,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:49,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 05:06:49,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:49,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:06:49,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:06:49,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:06:49,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:49,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:49,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 5, 3, 5, 3, 5, 2, 2, 1] term [2020-10-16 05:06:49,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:06:49,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:06:49,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:49,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:49,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:49,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:06:49,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:06:49,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:06:49,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:06:49,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:06:49,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:06:49,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:06:49,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:49,244 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 05:06:49,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:49,246 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 05:06:49,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:49,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:49,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:49,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:49,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:49,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:49,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:49,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:49,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:49,515 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2020-10-16 05:06:49,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:06:49,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:49,869 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:06:49,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:06:49,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:06:49,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:06:49,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:06:49,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:06:49,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:06:49,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:49,879 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 05:06:49,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:49,881 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 05:06:49,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:06:49,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-16 05:06:49,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:49,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:06:49,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:06:49,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:06:49,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:06:49,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 5, 2, 4, 3, 5, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:06:49,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 05:06:49,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:06:49,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:50,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:50,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:50,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 05:06:50,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:06:50,700 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-16 05:06:50,854 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-16 05:06:51,339 WARN L193 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 130 [2020-10-16 05:06:51,582 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-10-16 05:06:51,587 INFO L132 LiptonReduction]: Checked pairs total: 2760 [2020-10-16 05:06:51,587 INFO L134 LiptonReduction]: Total number of compositions: 80 [2020-10-16 05:06:51,590 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7408 [2020-10-16 05:06:51,598 INFO L129 PetriNetUnfolder]: 0/12 cut-off events. [2020-10-16 05:06:51,598 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:06:51,599 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:51,600 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:06:51,600 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:51,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:51,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1299872426, now seen corresponding path program 1 times [2020-10-16 05:06:51,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:51,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908110007] [2020-10-16 05:06:51,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:06:51,793 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 05:06:51,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908110007] [2020-10-16 05:06:51,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:06:51,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:06:51,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19715208] [2020-10-16 05:06:51,806 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-16 05:06:51,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:06:51,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-16 05:06:51,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-16 05:06:51,825 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 187 [2020-10-16 05:06:51,829 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 49 flow. Second operand 2 states. [2020-10-16 05:06:51,830 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:06:51,830 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 187 [2020-10-16 05:06:51,831 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:06:51,842 INFO L129 PetriNetUnfolder]: 0/19 cut-off events. [2020-10-16 05:06:51,843 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:06:51,843 INFO L80 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 1/20 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2020-10-16 05:06:51,844 INFO L132 encePairwiseOnDemand]: 186/187 looper letters, 0 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2020-10-16 05:06:51,844 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 19 transitions, 47 flow [2020-10-16 05:06:51,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-16 05:06:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-10-16 05:06:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 361 transitions. [2020-10-16 05:06:51,860 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.9652406417112299 [2020-10-16 05:06:51,861 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 361 transitions. [2020-10-16 05:06:51,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 361 transitions. [2020-10-16 05:06:51,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:06:51,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 361 transitions. [2020-10-16 05:06:51,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 3 states. [2020-10-16 05:06:51,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 3 states. [2020-10-16 05:06:51,879 INFO L81 ComplementDD]: Finished complementDD. Result 3 states. [2020-10-16 05:06:51,881 INFO L185 Difference]: Start difference. First operand has 29 places, 20 transitions, 49 flow. Second operand 2 states and 361 transitions. [2020-10-16 05:06:51,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 19 transitions, 47 flow [2020-10-16 05:06:51,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 19 transitions, 44 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 05:06:51,886 INFO L241 Difference]: Finished difference. Result has 27 places, 19 transitions, 44 flow [2020-10-16 05:06:51,889 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2020-10-16 05:06:51,890 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, -2 predicate places. [2020-10-16 05:06:51,890 INFO L481 AbstractCegarLoop]: Abstraction has has 27 places, 19 transitions, 44 flow [2020-10-16 05:06:51,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-16 05:06:51,890 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:51,890 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:06:51,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 05:06:51,891 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:51,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:51,891 INFO L82 PathProgramCache]: Analyzing trace with hash 658049905, now seen corresponding path program 1 times [2020-10-16 05:06:51,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:51,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217688407] [2020-10-16 05:06:51,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:06:52,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:06:52,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217688407] [2020-10-16 05:06:52,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:06:52,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:06:52,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591042026] [2020-10-16 05:06:52,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:06:52,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:06:52,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:06:52,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:06:52,009 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 187 [2020-10-16 05:06:52,009 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 19 transitions, 44 flow. Second operand 3 states. [2020-10-16 05:06:52,009 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:06:52,009 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 187 [2020-10-16 05:06:52,010 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:06:52,033 INFO L129 PetriNetUnfolder]: 3/29 cut-off events. [2020-10-16 05:06:52,034 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:06:52,034 INFO L80 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 29 events. 3/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 43 event pairs, 1 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 45. Up to 10 conditions per place. [2020-10-16 05:06:52,035 INFO L132 encePairwiseOnDemand]: 183/187 looper letters, 3 selfloop transitions, 3 changer transitions 0/21 dead transitions. [2020-10-16 05:06:52,035 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 21 transitions, 60 flow [2020-10-16 05:06:52,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:06:52,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:06:52,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2020-10-16 05:06:52,040 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.9001782531194296 [2020-10-16 05:06:52,040 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 505 transitions. [2020-10-16 05:06:52,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 505 transitions. [2020-10-16 05:06:52,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:06:52,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 505 transitions. [2020-10-16 05:06:52,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:06:52,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:06:52,045 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:06:52,045 INFO L185 Difference]: Start difference. First operand has 27 places, 19 transitions, 44 flow. Second operand 3 states and 505 transitions. [2020-10-16 05:06:52,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 21 transitions, 60 flow [2020-10-16 05:06:52,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 21 transitions, 60 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-16 05:06:52,047 INFO L241 Difference]: Finished difference. Result has 30 places, 21 transitions, 63 flow [2020-10-16 05:06:52,047 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=63, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2020-10-16 05:06:52,047 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2020-10-16 05:06:52,048 INFO L481 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 63 flow [2020-10-16 05:06:52,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:06:52,048 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:52,048 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:06:52,048 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 05:06:52,048 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:52,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:52,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1075289340, now seen corresponding path program 1 times [2020-10-16 05:06:52,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:52,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325107324] [2020-10-16 05:06:52,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:06:52,170 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 05:06:52,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325107324] [2020-10-16 05:06:52,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:06:52,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:06:52,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548214057] [2020-10-16 05:06:52,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:06:52,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:06:52,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:06:52,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:06:52,173 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 187 [2020-10-16 05:06:52,174 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 63 flow. Second operand 3 states. [2020-10-16 05:06:52,174 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:06:52,174 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 187 [2020-10-16 05:06:52,174 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:06:52,191 INFO L129 PetriNetUnfolder]: 3/29 cut-off events. [2020-10-16 05:06:52,191 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-16 05:06:52,192 INFO L80 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 29 events. 3/29 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 47 event pairs, 1 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 52. Up to 10 conditions per place. [2020-10-16 05:06:52,192 INFO L132 encePairwiseOnDemand]: 184/187 looper letters, 1 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2020-10-16 05:06:52,192 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 21 transitions, 69 flow [2020-10-16 05:06:52,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:06:52,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:06:52,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2020-10-16 05:06:52,195 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8734402852049911 [2020-10-16 05:06:52,195 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 490 transitions. [2020-10-16 05:06:52,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 490 transitions. [2020-10-16 05:06:52,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:06:52,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 490 transitions. [2020-10-16 05:06:52,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:06:52,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:06:52,200 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:06:52,200 INFO L185 Difference]: Start difference. First operand has 30 places, 21 transitions, 63 flow. Second operand 3 states and 490 transitions. [2020-10-16 05:06:52,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 21 transitions, 69 flow [2020-10-16 05:06:52,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 21 transitions, 66 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 05:06:52,201 INFO L241 Difference]: Finished difference. Result has 32 places, 21 transitions, 68 flow [2020-10-16 05:06:52,202 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2020-10-16 05:06:52,202 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2020-10-16 05:06:52,202 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 68 flow [2020-10-16 05:06:52,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:06:52,202 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:52,202 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:06:52,203 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 05:06:52,203 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:52,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:52,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1057110998, now seen corresponding path program 1 times [2020-10-16 05:06:52,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:52,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318697808] [2020-10-16 05:06:52,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:06:52,687 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 05:06:52,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318697808] [2020-10-16 05:06:52,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:06:52,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:06:52,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908076746] [2020-10-16 05:06:52,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:06:52,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:06:52,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:06:52,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:06:52,691 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 187 [2020-10-16 05:06:52,692 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 68 flow. Second operand 7 states. [2020-10-16 05:06:52,692 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:06:52,692 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 187 [2020-10-16 05:06:52,692 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:06:53,002 INFO L129 PetriNetUnfolder]: 98/215 cut-off events. [2020-10-16 05:06:53,003 INFO L130 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2020-10-16 05:06:53,005 INFO L80 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 215 events. 98/215 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 914 event pairs, 43 based on Foata normal form. 8/221 useless extension candidates. Maximal degree in co-relation 466. Up to 121 conditions per place. [2020-10-16 05:06:53,006 INFO L132 encePairwiseOnDemand]: 183/187 looper letters, 14 selfloop transitions, 4 changer transitions 0/29 dead transitions. [2020-10-16 05:06:53,007 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 123 flow [2020-10-16 05:06:53,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 05:06:53,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 05:06:53,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2020-10-16 05:06:53,009 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6510695187165776 [2020-10-16 05:06:53,010 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 487 transitions. [2020-10-16 05:06:53,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 487 transitions. [2020-10-16 05:06:53,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:06:53,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 487 transitions. [2020-10-16 05:06:53,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 05:06:53,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 05:06:53,015 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 05:06:53,015 INFO L185 Difference]: Start difference. First operand has 32 places, 21 transitions, 68 flow. Second operand 4 states and 487 transitions. [2020-10-16 05:06:53,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 123 flow [2020-10-16 05:06:53,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 29 transitions, 117 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:06:53,017 INFO L241 Difference]: Finished difference. Result has 35 places, 23 transitions, 86 flow [2020-10-16 05:06:53,017 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2020-10-16 05:06:53,017 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2020-10-16 05:06:53,017 INFO L481 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 86 flow [2020-10-16 05:06:53,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:06:53,018 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:53,018 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:06:53,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 05:06:53,018 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:53,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:53,018 INFO L82 PathProgramCache]: Analyzing trace with hash 757469777, now seen corresponding path program 1 times [2020-10-16 05:06:53,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:53,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179473411] [2020-10-16 05:06:53,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:06:53,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:06:53,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179473411] [2020-10-16 05:06:53,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:06:53,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:06:53,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587854489] [2020-10-16 05:06:53,131 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:06:53,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:06:53,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:06:53,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:06:53,133 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 187 [2020-10-16 05:06:53,134 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 86 flow. Second operand 4 states. [2020-10-16 05:06:53,134 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:06:53,134 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 187 [2020-10-16 05:06:53,134 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:06:53,183 INFO L129 PetriNetUnfolder]: 52/137 cut-off events. [2020-10-16 05:06:53,183 INFO L130 PetriNetUnfolder]: For 40/43 co-relation queries the response was YES. [2020-10-16 05:06:53,184 INFO L80 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 137 events. 52/137 cut-off events. For 40/43 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 642 event pairs, 5 based on Foata normal form. 13/133 useless extension candidates. Maximal degree in co-relation 299. Up to 54 conditions per place. [2020-10-16 05:06:53,186 INFO L132 encePairwiseOnDemand]: 181/187 looper letters, 8 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2020-10-16 05:06:53,186 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 30 transitions, 126 flow [2020-10-16 05:06:53,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 05:06:53,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 05:06:53,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 615 transitions. [2020-10-16 05:06:53,189 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8221925133689839 [2020-10-16 05:06:53,189 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 615 transitions. [2020-10-16 05:06:53,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 615 transitions. [2020-10-16 05:06:53,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:06:53,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 615 transitions. [2020-10-16 05:06:53,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 05:06:53,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 05:06:53,193 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 05:06:53,193 INFO L185 Difference]: Start difference. First operand has 35 places, 23 transitions, 86 flow. Second operand 4 states and 615 transitions. [2020-10-16 05:06:53,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 30 transitions, 126 flow [2020-10-16 05:06:53,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 30 transitions, 123 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 05:06:53,195 INFO L241 Difference]: Finished difference. Result has 39 places, 27 transitions, 121 flow [2020-10-16 05:06:53,196 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2020-10-16 05:06:53,196 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 10 predicate places. [2020-10-16 05:06:53,196 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 121 flow [2020-10-16 05:06:53,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:06:53,196 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:53,197 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:06:53,197 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 05:06:53,197 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:53,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:53,197 INFO L82 PathProgramCache]: Analyzing trace with hash -584219369, now seen corresponding path program 1 times [2020-10-16 05:06:53,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:53,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248060550] [2020-10-16 05:06:53,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:06:53,700 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 05:06:53,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248060550] [2020-10-16 05:06:53,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:06:53,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 05:06:53,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197155002] [2020-10-16 05:06:53,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 05:06:53,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:06:53,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 05:06:53,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-16 05:06:53,704 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 187 [2020-10-16 05:06:53,705 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 121 flow. Second operand 8 states. [2020-10-16 05:06:53,705 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:06:53,705 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 187 [2020-10-16 05:06:53,705 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:06:54,463 INFO L129 PetriNetUnfolder]: 532/937 cut-off events. [2020-10-16 05:06:54,464 INFO L130 PetriNetUnfolder]: For 726/734 co-relation queries the response was YES. [2020-10-16 05:06:54,468 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2868 conditions, 937 events. 532/937 cut-off events. For 726/734 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4825 event pairs, 100 based on Foata normal form. 17/944 useless extension candidates. Maximal degree in co-relation 2858. Up to 508 conditions per place. [2020-10-16 05:06:54,475 INFO L132 encePairwiseOnDemand]: 176/187 looper letters, 31 selfloop transitions, 34 changer transitions 7/79 dead transitions. [2020-10-16 05:06:54,476 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 79 transitions, 470 flow [2020-10-16 05:06:54,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 05:06:54,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 05:06:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1015 transitions. [2020-10-16 05:06:54,481 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6030897207367796 [2020-10-16 05:06:54,481 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1015 transitions. [2020-10-16 05:06:54,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1015 transitions. [2020-10-16 05:06:54,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:06:54,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1015 transitions. [2020-10-16 05:06:54,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 05:06:54,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 05:06:54,488 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 05:06:54,488 INFO L185 Difference]: Start difference. First operand has 39 places, 27 transitions, 121 flow. Second operand 9 states and 1015 transitions. [2020-10-16 05:06:54,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 79 transitions, 470 flow [2020-10-16 05:06:54,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 79 transitions, 465 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 05:06:54,495 INFO L241 Difference]: Finished difference. Result has 51 places, 58 transitions, 391 flow [2020-10-16 05:06:54,495 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=391, PETRI_PLACES=51, PETRI_TRANSITIONS=58} [2020-10-16 05:06:54,495 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 22 predicate places. [2020-10-16 05:06:54,495 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 58 transitions, 391 flow [2020-10-16 05:06:54,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 05:06:54,496 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:54,496 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:06:54,496 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 05:06:54,496 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:54,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:54,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1273453087, now seen corresponding path program 2 times [2020-10-16 05:06:54,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:54,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316138220] [2020-10-16 05:06:54,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:06:54,589 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 05:06:54,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316138220] [2020-10-16 05:06:54,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:06:54,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:06:54,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481458941] [2020-10-16 05:06:54,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:06:54,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:06:54,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:06:54,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:06:54,593 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 187 [2020-10-16 05:06:54,594 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 58 transitions, 391 flow. Second operand 5 states. [2020-10-16 05:06:54,594 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:06:54,594 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 187 [2020-10-16 05:06:54,595 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:06:54,765 INFO L129 PetriNetUnfolder]: 208/478 cut-off events. [2020-10-16 05:06:54,765 INFO L130 PetriNetUnfolder]: For 1352/1505 co-relation queries the response was YES. [2020-10-16 05:06:54,768 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1972 conditions, 478 events. 208/478 cut-off events. For 1352/1505 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2886 event pairs, 12 based on Foata normal form. 61/471 useless extension candidates. Maximal degree in co-relation 1957. Up to 286 conditions per place. [2020-10-16 05:06:54,772 INFO L132 encePairwiseOnDemand]: 181/187 looper letters, 11 selfloop transitions, 19 changer transitions 0/64 dead transitions. [2020-10-16 05:06:54,772 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 64 transitions, 481 flow [2020-10-16 05:06:54,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:06:54,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:06:54,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 769 transitions. [2020-10-16 05:06:54,777 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8224598930481284 [2020-10-16 05:06:54,778 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 769 transitions. [2020-10-16 05:06:54,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 769 transitions. [2020-10-16 05:06:54,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:06:54,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 769 transitions. [2020-10-16 05:06:54,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:06:54,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:06:54,782 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:06:54,783 INFO L185 Difference]: Start difference. First operand has 51 places, 58 transitions, 391 flow. Second operand 5 states and 769 transitions. [2020-10-16 05:06:54,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 64 transitions, 481 flow [2020-10-16 05:06:54,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 463 flow, removed 3 selfloop flow, removed 1 redundant places. [2020-10-16 05:06:54,793 INFO L241 Difference]: Finished difference. Result has 56 places, 61 transitions, 465 flow [2020-10-16 05:06:54,793 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=465, PETRI_PLACES=56, PETRI_TRANSITIONS=61} [2020-10-16 05:06:54,793 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 27 predicate places. [2020-10-16 05:06:54,793 INFO L481 AbstractCegarLoop]: Abstraction has has 56 places, 61 transitions, 465 flow [2020-10-16 05:06:54,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:06:54,794 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:54,794 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:06:54,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 05:06:54,794 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:54,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:54,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1154941236, now seen corresponding path program 1 times [2020-10-16 05:06:54,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:54,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211912292] [2020-10-16 05:06:54,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:06:55,136 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 05:06:55,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211912292] [2020-10-16 05:06:55,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:06:55,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:06:55,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901155394] [2020-10-16 05:06:55,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:06:55,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:06:55,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:06:55,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:06:55,142 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 187 [2020-10-16 05:06:55,143 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 61 transitions, 465 flow. Second operand 7 states. [2020-10-16 05:06:55,143 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:06:55,143 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 187 [2020-10-16 05:06:55,143 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:06:55,481 INFO L129 PetriNetUnfolder]: 255/584 cut-off events. [2020-10-16 05:06:55,482 INFO L130 PetriNetUnfolder]: For 2045/2114 co-relation queries the response was YES. [2020-10-16 05:06:55,485 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2696 conditions, 584 events. 255/584 cut-off events. For 2045/2114 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3546 event pairs, 28 based on Foata normal form. 20/529 useless extension candidates. Maximal degree in co-relation 2678. Up to 257 conditions per place. [2020-10-16 05:06:55,491 INFO L132 encePairwiseOnDemand]: 181/187 looper letters, 31 selfloop transitions, 16 changer transitions 1/78 dead transitions. [2020-10-16 05:06:55,492 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 78 transitions, 693 flow [2020-10-16 05:06:55,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:06:55,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:06:55,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 611 transitions. [2020-10-16 05:06:55,496 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.653475935828877 [2020-10-16 05:06:55,497 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 611 transitions. [2020-10-16 05:06:55,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 611 transitions. [2020-10-16 05:06:55,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:06:55,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 611 transitions. [2020-10-16 05:06:55,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:06:55,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:06:55,503 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:06:55,503 INFO L185 Difference]: Start difference. First operand has 56 places, 61 transitions, 465 flow. Second operand 5 states and 611 transitions. [2020-10-16 05:06:55,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 78 transitions, 693 flow [2020-10-16 05:06:55,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 78 transitions, 673 flow, removed 3 selfloop flow, removed 2 redundant places. [2020-10-16 05:06:55,520 INFO L241 Difference]: Finished difference. Result has 60 places, 69 transitions, 563 flow [2020-10-16 05:06:55,520 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=563, PETRI_PLACES=60, PETRI_TRANSITIONS=69} [2020-10-16 05:06:55,521 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 31 predicate places. [2020-10-16 05:06:55,521 INFO L481 AbstractCegarLoop]: Abstraction has has 60 places, 69 transitions, 563 flow [2020-10-16 05:06:55,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:06:55,521 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:55,521 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:06:55,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 05:06:55,522 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:55,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:55,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1445841860, now seen corresponding path program 2 times [2020-10-16 05:06:55,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:55,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016736976] [2020-10-16 05:06:55,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:06:55,667 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 05:06:55,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016736976] [2020-10-16 05:06:55,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:06:55,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:06:55,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653871578] [2020-10-16 05:06:55,669 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:06:55,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:06:55,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:06:55,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:06:55,672 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 187 [2020-10-16 05:06:55,673 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 69 transitions, 563 flow. Second operand 6 states. [2020-10-16 05:06:55,674 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:06:55,674 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 187 [2020-10-16 05:06:55,674 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:06:55,861 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] L786-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_11|) (= |v_P1Thread1of1ForFork2_#res.base_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][28], [Black: 128#(and (= ~__unbuffered_p2_EAX$read_delayed~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 192#(and (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~__unbuffered_p2_EAX~0) (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd2~0 0) (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|) (= ~x$r_buff1_thd0~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), Black: 194#(and (or (not (= ~__unbuffered_p0_EAX~0 0)) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) 0)) (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1)) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~__unbuffered_p2_EAX~0) (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|)), 5#L821true, Black: 133#(and (= (select |#valid| |~#x~0.base|) 1) (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$w_buff1~0 ~x$w_buff0~0) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1)) (= |~#x~0.offset| 0)), Black: 139#(and (= (select |#valid| |~#x~0.base|) 1) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~__unbuffered_p2_EAX~0) (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= ~x$w_buff1~0 ~x$w_buff0~0) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|) (= ~x$r_buff1_thd0~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1)) (= |~#x~0.offset| 0)), 209#(and (<= ~__unbuffered_cnt~0 2) (= ~main$tmp_guard0~0 0)), 146#(= ~main$tmp_guard0~0 0), Black: 148#(and (= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0)), 152#true, Black: 161#(and (= 0 ~x$r_buff0_thd3~0) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~__unbuffered_p2_EAX~0) (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_cnt~0 0)), Black: 154#(and (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_cnt~0 0)), Black: 157#(and (= ~__unbuffered_p0_EAX~0 ~__unbuffered_p2_EAX~0) (or (not (= ~__unbuffered_p0_EAX~0 0)) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (<= ~__unbuffered_cnt~0 1) (or (and (or (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0) (not (= ~__unbuffered_p0_EAX~0 0))) (or (and (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|)) (not (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0)))) (not (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff0~0)))), Black: 158#(and (= ~__unbuffered_p0_EAX~0 ~__unbuffered_p2_EAX~0) (or (and (or (and (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|) (not (= ~x$w_buff1~0 1))) (not (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0))) (or (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0) (not (= ~__unbuffered_p0_EAX~0 0)))) (not (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff0~0))) (or (not (= ~__unbuffered_p0_EAX~0 0)) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0)), Black: 159#(and (or (not (= ~__unbuffered_p0_EAX~0 0)) (not (= (select (select |#memory_int| ~__unbuffered_p2_EAX$read_delayed_var~0.base) ~__unbuffered_p2_EAX$read_delayed_var~0.offset) 1))) (= ~__unbuffered_p0_EAX~0 ~__unbuffered_p2_EAX~0)), 43#L843-1true, 45#P0EXITtrue, 109#P1EXITtrue, 176#(= ~main$tmp_guard0~0 0), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 118#true, Black: 180#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0)), 186#(and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), Black: 123#(= ~y~0 0)]) [2020-10-16 05:06:55,862 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is not cut-off event [2020-10-16 05:06:55,862 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2020-10-16 05:06:55,862 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2020-10-16 05:06:55,862 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2020-10-16 05:06:55,872 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] L786-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_11|) (= |v_P1Thread1of1ForFork2_#res.base_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][28], [Black: 128#(and (= ~__unbuffered_p2_EAX$read_delayed~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 192#(and (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~__unbuffered_p2_EAX~0) (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd2~0 0) (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|) (= ~x$r_buff1_thd0~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), Black: 194#(and (or (not (= ~__unbuffered_p0_EAX~0 0)) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) 0)) (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1)) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~__unbuffered_p2_EAX~0) (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|)), 5#L821true, Black: 133#(and (= (select |#valid| |~#x~0.base|) 1) (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$w_buff1~0 ~x$w_buff0~0) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1)) (= |~#x~0.offset| 0)), Black: 139#(and (= (select |#valid| |~#x~0.base|) 1) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~__unbuffered_p2_EAX~0) (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= ~x$w_buff1~0 ~x$w_buff0~0) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|) (= ~x$r_buff1_thd0~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1)) (= |~#x~0.offset| 0)), 209#(and (<= ~__unbuffered_cnt~0 2) (= ~main$tmp_guard0~0 0)), 146#(= ~main$tmp_guard0~0 0), Black: 148#(and (= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0)), 152#true, 30#L846true, Black: 161#(and (= 0 ~x$r_buff0_thd3~0) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~__unbuffered_p2_EAX~0) (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_cnt~0 0)), Black: 154#(and (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_cnt~0 0)), Black: 157#(and (= ~__unbuffered_p0_EAX~0 ~__unbuffered_p2_EAX~0) (or (not (= ~__unbuffered_p0_EAX~0 0)) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (<= ~__unbuffered_cnt~0 1) (or (and (or (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0) (not (= ~__unbuffered_p0_EAX~0 0))) (or (and (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|)) (not (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0)))) (not (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff0~0)))), Black: 158#(and (= ~__unbuffered_p0_EAX~0 ~__unbuffered_p2_EAX~0) (or (and (or (and (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|) (not (= ~x$w_buff1~0 1))) (not (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0))) (or (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0) (not (= ~__unbuffered_p0_EAX~0 0)))) (not (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff0~0))) (or (not (= ~__unbuffered_p0_EAX~0 0)) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0)), Black: 159#(and (or (not (= ~__unbuffered_p0_EAX~0 0)) (not (= (select (select |#memory_int| ~__unbuffered_p2_EAX$read_delayed_var~0.base) ~__unbuffered_p2_EAX$read_delayed_var~0.offset) 1))) (= ~__unbuffered_p0_EAX~0 ~__unbuffered_p2_EAX~0)), 45#P0EXITtrue, 109#P1EXITtrue, 176#(= ~main$tmp_guard0~0 0), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 118#true, Black: 180#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0)), 186#(and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), Black: 123#(= ~y~0 0)]) [2020-10-16 05:06:55,873 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is not cut-off event [2020-10-16 05:06:55,873 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2020-10-16 05:06:55,873 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2020-10-16 05:06:55,873 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2020-10-16 05:06:55,874 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] L786-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_11|) (= |v_P1Thread1of1ForFork2_#res.base_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][28], [Black: 128#(and (= ~__unbuffered_p2_EAX$read_delayed~0 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 192#(and (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~__unbuffered_p2_EAX~0) (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd2~0 0) (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|) (= ~x$r_buff1_thd0~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), Black: 194#(and (or (not (= ~__unbuffered_p0_EAX~0 0)) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) 0)) (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1)) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~__unbuffered_p2_EAX~0) (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|)), 5#L821true, Black: 133#(and (= (select |#valid| |~#x~0.base|) 1) (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$w_buff1~0 ~x$w_buff0~0) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1)) (= |~#x~0.offset| 0)), Black: 139#(and (= (select |#valid| |~#x~0.base|) 1) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~__unbuffered_p2_EAX~0) (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= ~x$w_buff1~0 ~x$w_buff0~0) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|) (= ~x$r_buff1_thd0~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1)) (= |~#x~0.offset| 0)), 209#(and (<= ~__unbuffered_cnt~0 2) (= ~main$tmp_guard0~0 0)), Black: 146#(= ~main$tmp_guard0~0 0), Black: 148#(and (= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0)), 152#true, 30#L846true, Black: 161#(and (= 0 ~x$r_buff0_thd3~0) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~__unbuffered_p2_EAX~0) (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_cnt~0 0)), Black: 154#(and (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_cnt~0 0)), Black: 157#(and (= ~__unbuffered_p0_EAX~0 ~__unbuffered_p2_EAX~0) (or (not (= ~__unbuffered_p0_EAX~0 0)) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (<= ~__unbuffered_cnt~0 1) (or (and (or (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0) (not (= ~__unbuffered_p0_EAX~0 0))) (or (and (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|)) (not (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0)))) (not (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff0~0)))), Black: 158#(and (= ~__unbuffered_p0_EAX~0 ~__unbuffered_p2_EAX~0) (or (and (or (and (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|) (not (= ~x$w_buff1~0 1))) (not (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0))) (or (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0) (not (= ~__unbuffered_p0_EAX~0 0)))) (not (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff0~0))) (or (not (= ~__unbuffered_p0_EAX~0 0)) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0)), Black: 159#(and (or (not (= ~__unbuffered_p0_EAX~0 0)) (not (= (select (select |#memory_int| ~__unbuffered_p2_EAX$read_delayed_var~0.base) ~__unbuffered_p2_EAX$read_delayed_var~0.offset) 1))) (= ~__unbuffered_p0_EAX~0 ~__unbuffered_p2_EAX~0)), 45#P0EXITtrue, 109#P1EXITtrue, 176#(= ~main$tmp_guard0~0 0), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 118#true, Black: 180#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0)), 186#(and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), Black: 123#(= ~y~0 0)]) [2020-10-16 05:06:55,874 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is not cut-off event [2020-10-16 05:06:55,874 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2020-10-16 05:06:55,874 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2020-10-16 05:06:55,874 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2020-10-16 05:06:55,894 INFO L129 PetriNetUnfolder]: 227/512 cut-off events. [2020-10-16 05:06:55,894 INFO L130 PetriNetUnfolder]: For 2078/2305 co-relation queries the response was YES. [2020-10-16 05:06:55,899 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2596 conditions, 512 events. 227/512 cut-off events. For 2078/2305 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 3161 event pairs, 13 based on Foata normal form. 63/492 useless extension candidates. Maximal degree in co-relation 2576. Up to 251 conditions per place. [2020-10-16 05:06:55,903 INFO L132 encePairwiseOnDemand]: 181/187 looper letters, 5 selfloop transitions, 22 changer transitions 1/70 dead transitions. [2020-10-16 05:06:55,904 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 70 transitions, 625 flow [2020-10-16 05:06:55,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 05:06:55,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 05:06:55,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 917 transitions. [2020-10-16 05:06:55,909 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8172905525846702 [2020-10-16 05:06:55,910 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 917 transitions. [2020-10-16 05:06:55,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 917 transitions. [2020-10-16 05:06:55,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:06:55,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 917 transitions. [2020-10-16 05:06:55,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 05:06:55,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 05:06:55,917 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 05:06:55,918 INFO L185 Difference]: Start difference. First operand has 60 places, 69 transitions, 563 flow. Second operand 6 states and 917 transitions. [2020-10-16 05:06:55,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 70 transitions, 625 flow [2020-10-16 05:06:55,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 70 transitions, 595 flow, removed 6 selfloop flow, removed 3 redundant places. [2020-10-16 05:06:55,931 INFO L241 Difference]: Finished difference. Result has 64 places, 69 transitions, 594 flow [2020-10-16 05:06:55,932 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=594, PETRI_PLACES=64, PETRI_TRANSITIONS=69} [2020-10-16 05:06:55,932 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 35 predicate places. [2020-10-16 05:06:55,932 INFO L481 AbstractCegarLoop]: Abstraction has has 64 places, 69 transitions, 594 flow [2020-10-16 05:06:55,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:06:55,932 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:55,932 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 05:06:55,932 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 05:06:55,933 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:55,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:55,933 INFO L82 PathProgramCache]: Analyzing trace with hash -184222218, now seen corresponding path program 1 times [2020-10-16 05:06:55,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:55,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724785151] [2020-10-16 05:06:55,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:06:56,001 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 05:06:56,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724785151] [2020-10-16 05:06:56,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:06:56,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:06:56,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438577954] [2020-10-16 05:06:56,003 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:06:56,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:06:56,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:06:56,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:06:56,004 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 187 [2020-10-16 05:06:56,005 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 69 transitions, 594 flow. Second operand 3 states. [2020-10-16 05:06:56,005 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:06:56,005 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 187 [2020-10-16 05:06:56,005 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:06:56,159 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] L786-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_11|) (= |v_P1Thread1of1ForFork2_#res.base_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][28], [Black: 192#(and (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~__unbuffered_p2_EAX~0) (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd2~0 0) (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|) (= ~x$r_buff1_thd0~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), Black: 194#(and (or (not (= ~__unbuffered_p0_EAX~0 0)) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) 0)) (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1)) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~__unbuffered_p2_EAX~0) (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|)), 5#L821true, Black: 133#(and (= (select |#valid| |~#x~0.base|) 1) (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$w_buff1~0 ~x$w_buff0~0) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1)) (= |~#x~0.offset| 0)), 209#(and (<= ~__unbuffered_cnt~0 2) (= ~main$tmp_guard0~0 0)), 146#(= ~main$tmp_guard0~0 0), Black: 203#(= ~main$tmp_guard0~0 0), 215#(= ~y~0 1), Black: 148#(and (= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0)), 152#true, Black: 161#(and (= 0 ~x$r_buff0_thd3~0) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~__unbuffered_p2_EAX~0) (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_cnt~0 0)), Black: 154#(and (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_cnt~0 0)), Black: 157#(and (= ~__unbuffered_p0_EAX~0 ~__unbuffered_p2_EAX~0) (or (not (= ~__unbuffered_p0_EAX~0 0)) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (<= ~__unbuffered_cnt~0 1) (or (and (or (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0) (not (= ~__unbuffered_p0_EAX~0 0))) (or (and (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|)) (not (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0)))) (not (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff0~0)))), Black: 158#(and (= ~__unbuffered_p0_EAX~0 ~__unbuffered_p2_EAX~0) (or (and (or (and (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|) (not (= ~x$w_buff1~0 1))) (not (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0))) (or (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0) (not (= ~__unbuffered_p0_EAX~0 0)))) (not (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff0~0))) (or (not (= ~__unbuffered_p0_EAX~0 0)) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0)), Black: 159#(and (or (not (= ~__unbuffered_p0_EAX~0 0)) (not (= (select (select |#memory_int| ~__unbuffered_p2_EAX$read_delayed_var~0.base) ~__unbuffered_p2_EAX$read_delayed_var~0.offset) 1))) (= ~__unbuffered_p0_EAX~0 ~__unbuffered_p2_EAX~0)), 43#L843-1true, 109#P1EXITtrue, 45#P0EXITtrue, 176#(= ~main$tmp_guard0~0 0), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 118#true, Black: 180#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0)), 186#(and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), Black: 123#(= ~y~0 0)]) [2020-10-16 05:06:56,159 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is not cut-off event [2020-10-16 05:06:56,160 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2020-10-16 05:06:56,160 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2020-10-16 05:06:56,160 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2020-10-16 05:06:56,188 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] L786-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_11|) (= |v_P1Thread1of1ForFork2_#res.base_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][28], [Black: 192#(and (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~__unbuffered_p2_EAX~0) (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd2~0 0) (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|) (= ~x$r_buff1_thd0~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), Black: 194#(and (or (not (= ~__unbuffered_p0_EAX~0 0)) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) 0)) (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1)) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~__unbuffered_p2_EAX~0) (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|)), 5#L821true, Black: 133#(and (= (select |#valid| |~#x~0.base|) 1) (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$w_buff1~0 ~x$w_buff0~0) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1)) (= |~#x~0.offset| 0)), 209#(and (<= ~__unbuffered_cnt~0 2) (= ~main$tmp_guard0~0 0)), 146#(= ~main$tmp_guard0~0 0), Black: 203#(= ~main$tmp_guard0~0 0), Black: 148#(and (= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0)), 215#(= ~y~0 1), 152#true, 30#L846true, Black: 161#(and (= 0 ~x$r_buff0_thd3~0) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~__unbuffered_p2_EAX~0) (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_cnt~0 0)), Black: 154#(and (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_cnt~0 0)), Black: 157#(and (= ~__unbuffered_p0_EAX~0 ~__unbuffered_p2_EAX~0) (or (not (= ~__unbuffered_p0_EAX~0 0)) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (<= ~__unbuffered_cnt~0 1) (or (and (or (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0) (not (= ~__unbuffered_p0_EAX~0 0))) (or (and (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|)) (not (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0)))) (not (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff0~0)))), Black: 158#(and (= ~__unbuffered_p0_EAX~0 ~__unbuffered_p2_EAX~0) (or (and (or (and (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|) (not (= ~x$w_buff1~0 1))) (not (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0))) (or (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0) (not (= ~__unbuffered_p0_EAX~0 0)))) (not (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff0~0))) (or (not (= ~__unbuffered_p0_EAX~0 0)) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0)), Black: 159#(and (or (not (= ~__unbuffered_p0_EAX~0 0)) (not (= (select (select |#memory_int| ~__unbuffered_p2_EAX$read_delayed_var~0.base) ~__unbuffered_p2_EAX$read_delayed_var~0.offset) 1))) (= ~__unbuffered_p0_EAX~0 ~__unbuffered_p2_EAX~0)), 45#P0EXITtrue, 109#P1EXITtrue, 176#(= ~main$tmp_guard0~0 0), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 118#true, Black: 180#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0)), 186#(and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), Black: 123#(= ~y~0 0)]) [2020-10-16 05:06:56,188 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is not cut-off event [2020-10-16 05:06:56,188 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2020-10-16 05:06:56,188 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2020-10-16 05:06:56,189 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2020-10-16 05:06:56,189 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1309] L786-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_11|) (= |v_P1Thread1of1ForFork2_#res.base_11| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base][28], [Black: 192#(and (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~__unbuffered_p2_EAX~0) (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd2~0 0) (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|) (= ~x$r_buff1_thd0~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), Black: 194#(and (or (not (= ~__unbuffered_p0_EAX~0 0)) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) 0)) (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd0~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1)) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~__unbuffered_p2_EAX~0) (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd2~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|)), 5#L821true, Black: 133#(and (= (select |#valid| |~#x~0.base|) 1) (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$w_buff1~0 ~x$w_buff0~0) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1)) (= |~#x~0.offset| 0)), 209#(and (<= ~__unbuffered_cnt~0 2) (= ~main$tmp_guard0~0 0)), Black: 203#(= ~main$tmp_guard0~0 0), Black: 146#(= ~main$tmp_guard0~0 0), 215#(= ~y~0 1), Black: 148#(and (= ~main$tmp_guard0~0 0) (= ~__unbuffered_cnt~0 0)), 152#true, 30#L846true, Black: 161#(and (= 0 ~x$r_buff0_thd3~0) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~__unbuffered_p2_EAX~0) (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_cnt~0 0)), Black: 154#(and (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd3~0 0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$w_buff0~0) (= ~__unbuffered_cnt~0 0)), Black: 157#(and (= ~__unbuffered_p0_EAX~0 ~__unbuffered_p2_EAX~0) (or (not (= ~__unbuffered_p0_EAX~0 0)) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (<= ~__unbuffered_cnt~0 1) (or (and (or (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0) (not (= ~__unbuffered_p0_EAX~0 0))) (or (and (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= 0 ~x$w_buff1~0) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|)) (not (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0)))) (not (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff0~0)))), Black: 158#(and (= ~__unbuffered_p0_EAX~0 ~__unbuffered_p2_EAX~0) (or (and (or (and (= |~#x~0.base| ~__unbuffered_p2_EAX$read_delayed_var~0.base) (= ~__unbuffered_p2_EAX$read_delayed_var~0.offset |~#x~0.offset|) (not (= ~x$w_buff1~0 1))) (not (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0))) (or (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff1~0) (not (= ~__unbuffered_p0_EAX~0 0)))) (not (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff0~0))) (or (not (= ~__unbuffered_p0_EAX~0 0)) (= (select (select |#memory_int| |~#x~0.base|) |~#x~0.offset|) ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0)), Black: 159#(and (or (not (= ~__unbuffered_p0_EAX~0 0)) (not (= (select (select |#memory_int| ~__unbuffered_p2_EAX$read_delayed_var~0.base) ~__unbuffered_p2_EAX$read_delayed_var~0.offset) 1))) (= ~__unbuffered_p0_EAX~0 ~__unbuffered_p2_EAX~0)), 109#P1EXITtrue, 45#P0EXITtrue, 176#(= ~main$tmp_guard0~0 0), P2Thread1of1ForFork0InUse, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork1InUse, 118#true, Black: 180#(and (<= ~__unbuffered_cnt~0 1) (= ~main$tmp_guard0~0 0)), 186#(and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= ~x$r_buff1_thd2~0 0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= 0 ~x$w_buff1~0) (= 0 ~x$r_buff0_thd2~0) (= ~x$r_buff1_thd0~0 0) (< 0 (+ (div ~x$w_buff0_used~0 256) 1))), Black: 123#(= ~y~0 0)]) [2020-10-16 05:06:56,189 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is not cut-off event [2020-10-16 05:06:56,190 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2020-10-16 05:06:56,190 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2020-10-16 05:06:56,190 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2020-10-16 05:06:56,214 INFO L129 PetriNetUnfolder]: 352/807 cut-off events. [2020-10-16 05:06:56,214 INFO L130 PetriNetUnfolder]: For 4026/4078 co-relation queries the response was YES. [2020-10-16 05:06:56,221 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4040 conditions, 807 events. 352/807 cut-off events. For 4026/4078 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 5669 event pairs, 13 based on Foata normal form. 7/686 useless extension candidates. Maximal degree in co-relation 4020. Up to 425 conditions per place. [2020-10-16 05:06:56,225 INFO L132 encePairwiseOnDemand]: 184/187 looper letters, 3 selfloop transitions, 3 changer transitions 3/69 dead transitions. [2020-10-16 05:06:56,226 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 69 transitions, 606 flow [2020-10-16 05:06:56,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:06:56,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:06:56,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2020-10-16 05:06:56,229 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8983957219251337 [2020-10-16 05:06:56,229 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2020-10-16 05:06:56,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2020-10-16 05:06:56,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:06:56,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2020-10-16 05:06:56,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:06:56,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:06:56,234 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:06:56,234 INFO L185 Difference]: Start difference. First operand has 64 places, 69 transitions, 594 flow. Second operand 3 states and 504 transitions. [2020-10-16 05:06:56,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 69 transitions, 606 flow [2020-10-16 05:06:56,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 69 transitions, 561 flow, removed 7 selfloop flow, removed 3 redundant places. [2020-10-16 05:06:56,336 INFO L241 Difference]: Finished difference. Result has 64 places, 66 transitions, 532 flow [2020-10-16 05:06:56,336 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=532, PETRI_PLACES=64, PETRI_TRANSITIONS=66} [2020-10-16 05:06:56,336 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 35 predicate places. [2020-10-16 05:06:56,336 INFO L481 AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 532 flow [2020-10-16 05:06:56,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:06:56,337 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:56,337 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 05:06:56,337 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 05:06:56,337 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:56,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:56,338 INFO L82 PathProgramCache]: Analyzing trace with hash 2064291112, now seen corresponding path program 2 times [2020-10-16 05:06:56,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:56,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292261030] [2020-10-16 05:06:56,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:06:56,756 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 05:06:56,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292261030] [2020-10-16 05:06:56,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:06:56,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 05:06:56,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093023613] [2020-10-16 05:06:56,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 05:06:56,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:06:56,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 05:06:56,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-10-16 05:06:56,759 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 187 [2020-10-16 05:06:56,760 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 66 transitions, 532 flow. Second operand 12 states. [2020-10-16 05:06:56,761 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:06:56,761 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 187 [2020-10-16 05:06:56,761 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:06:57,709 INFO L129 PetriNetUnfolder]: 685/1347 cut-off events. [2020-10-16 05:06:57,709 INFO L130 PetriNetUnfolder]: For 5083/5125 co-relation queries the response was YES. [2020-10-16 05:06:57,717 INFO L80 FinitePrefix]: Finished finitePrefix Result has 7049 conditions, 1347 events. 685/1347 cut-off events. For 5083/5125 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 8671 event pairs, 78 based on Foata normal form. 27/1358 useless extension candidates. Maximal degree in co-relation 7028. Up to 745 conditions per place. [2020-10-16 05:06:57,722 INFO L132 encePairwiseOnDemand]: 177/187 looper letters, 32 selfloop transitions, 38 changer transitions 18/95 dead transitions. [2020-10-16 05:06:57,722 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 95 transitions, 946 flow [2020-10-16 05:06:57,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 05:06:57,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 05:06:57,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 865 transitions. [2020-10-16 05:06:57,726 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5782085561497327 [2020-10-16 05:06:57,726 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 865 transitions. [2020-10-16 05:06:57,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 865 transitions. [2020-10-16 05:06:57,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:06:57,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 865 transitions. [2020-10-16 05:06:57,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 05:06:57,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 05:06:57,732 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 05:06:57,732 INFO L185 Difference]: Start difference. First operand has 64 places, 66 transitions, 532 flow. Second operand 8 states and 865 transitions. [2020-10-16 05:06:57,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 95 transitions, 946 flow [2020-10-16 05:06:57,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 95 transitions, 918 flow, removed 4 selfloop flow, removed 2 redundant places. [2020-10-16 05:06:57,764 INFO L241 Difference]: Finished difference. Result has 73 places, 72 transitions, 715 flow [2020-10-16 05:06:57,764 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=715, PETRI_PLACES=73, PETRI_TRANSITIONS=72} [2020-10-16 05:06:57,764 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 44 predicate places. [2020-10-16 05:06:57,765 INFO L481 AbstractCegarLoop]: Abstraction has has 73 places, 72 transitions, 715 flow [2020-10-16 05:06:57,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 05:06:57,765 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:57,765 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 05:06:57,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 05:06:57,765 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:57,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:57,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1832340748, now seen corresponding path program 3 times [2020-10-16 05:06:57,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:57,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104168303] [2020-10-16 05:06:57,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:06:57,901 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 05:06:57,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104168303] [2020-10-16 05:06:57,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:06:57,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 05:06:57,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422108582] [2020-10-16 05:06:57,903 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 05:06:57,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:06:57,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 05:06:57,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-16 05:06:57,905 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 187 [2020-10-16 05:06:57,905 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 72 transitions, 715 flow. Second operand 9 states. [2020-10-16 05:06:57,906 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:06:57,906 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 187 [2020-10-16 05:06:57,906 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:06:58,414 INFO L129 PetriNetUnfolder]: 278/593 cut-off events. [2020-10-16 05:06:58,414 INFO L130 PetriNetUnfolder]: For 3486/3529 co-relation queries the response was YES. [2020-10-16 05:06:58,418 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3542 conditions, 593 events. 278/593 cut-off events. For 3486/3529 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3273 event pairs, 19 based on Foata normal form. 22/611 useless extension candidates. Maximal degree in co-relation 3518. Up to 320 conditions per place. [2020-10-16 05:06:58,422 INFO L132 encePairwiseOnDemand]: 176/187 looper letters, 50 selfloop transitions, 26 changer transitions 40/123 dead transitions. [2020-10-16 05:06:58,422 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 123 transitions, 1383 flow [2020-10-16 05:06:58,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 05:06:58,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 05:06:58,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1186 transitions. [2020-10-16 05:06:58,429 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7046939988116458 [2020-10-16 05:06:58,429 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1186 transitions. [2020-10-16 05:06:58,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1186 transitions. [2020-10-16 05:06:58,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:06:58,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1186 transitions. [2020-10-16 05:06:58,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 05:06:58,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 05:06:58,440 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 05:06:58,440 INFO L185 Difference]: Start difference. First operand has 73 places, 72 transitions, 715 flow. Second operand 9 states and 1186 transitions. [2020-10-16 05:06:58,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 123 transitions, 1383 flow [2020-10-16 05:06:58,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 123 transitions, 1163 flow, removed 24 selfloop flow, removed 10 redundant places. [2020-10-16 05:06:58,473 INFO L241 Difference]: Finished difference. Result has 75 places, 78 transitions, 716 flow [2020-10-16 05:06:58,473 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=716, PETRI_PLACES=75, PETRI_TRANSITIONS=78} [2020-10-16 05:06:58,474 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 46 predicate places. [2020-10-16 05:06:58,474 INFO L481 AbstractCegarLoop]: Abstraction has has 75 places, 78 transitions, 716 flow [2020-10-16 05:06:58,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 05:06:58,474 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:58,474 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 05:06:58,475 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 05:06:58,475 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:58,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:58,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1629080818, now seen corresponding path program 4 times [2020-10-16 05:06:58,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:58,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283725753] [2020-10-16 05:06:58,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:06:58,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 05:06:58,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283725753] [2020-10-16 05:06:58,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:06:58,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:06:58,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444256104] [2020-10-16 05:06:58,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:06:58,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:06:58,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:06:58,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:06:58,738 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 187 [2020-10-16 05:06:58,739 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 78 transitions, 716 flow. Second operand 7 states. [2020-10-16 05:06:58,739 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:06:58,739 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 187 [2020-10-16 05:06:58,739 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:06:59,064 INFO L129 PetriNetUnfolder]: 298/752 cut-off events. [2020-10-16 05:06:59,064 INFO L130 PetriNetUnfolder]: For 3612/3676 co-relation queries the response was YES. [2020-10-16 05:06:59,068 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3935 conditions, 752 events. 298/752 cut-off events. For 3612/3676 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5161 event pairs, 13 based on Foata normal form. 24/763 useless extension candidates. Maximal degree in co-relation 3912. Up to 357 conditions per place. [2020-10-16 05:06:59,071 INFO L132 encePairwiseOnDemand]: 180/187 looper letters, 33 selfloop transitions, 16 changer transitions 29/113 dead transitions. [2020-10-16 05:06:59,071 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 113 transitions, 1170 flow [2020-10-16 05:06:59,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 05:06:59,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 05:06:59,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 830 transitions. [2020-10-16 05:06:59,075 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7397504456327986 [2020-10-16 05:06:59,075 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 830 transitions. [2020-10-16 05:06:59,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 830 transitions. [2020-10-16 05:06:59,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:06:59,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 830 transitions. [2020-10-16 05:06:59,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 05:06:59,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 05:06:59,080 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 05:06:59,080 INFO L185 Difference]: Start difference. First operand has 75 places, 78 transitions, 716 flow. Second operand 6 states and 830 transitions. [2020-10-16 05:06:59,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 113 transitions, 1170 flow [2020-10-16 05:06:59,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 113 transitions, 1107 flow, removed 23 selfloop flow, removed 5 redundant places. [2020-10-16 05:06:59,100 INFO L241 Difference]: Finished difference. Result has 73 places, 80 transitions, 746 flow [2020-10-16 05:06:59,100 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=746, PETRI_PLACES=73, PETRI_TRANSITIONS=80} [2020-10-16 05:06:59,101 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 44 predicate places. [2020-10-16 05:06:59,101 INFO L481 AbstractCegarLoop]: Abstraction has has 73 places, 80 transitions, 746 flow [2020-10-16 05:06:59,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:06:59,101 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:59,101 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 05:06:59,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 05:06:59,102 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:59,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:59,102 INFO L82 PathProgramCache]: Analyzing trace with hash -136834568, now seen corresponding path program 5 times [2020-10-16 05:06:59,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:59,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125476283] [2020-10-16 05:06:59,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:06:59,374 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 05:06:59,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125476283] [2020-10-16 05:06:59,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:06:59,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 05:06:59,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858384734] [2020-10-16 05:06:59,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 05:06:59,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:06:59,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 05:06:59,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-16 05:06:59,380 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 187 [2020-10-16 05:06:59,381 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 80 transitions, 746 flow. Second operand 11 states. [2020-10-16 05:06:59,381 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:06:59,381 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 187 [2020-10-16 05:06:59,382 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:06:59,819 INFO L129 PetriNetUnfolder]: 278/653 cut-off events. [2020-10-16 05:06:59,819 INFO L130 PetriNetUnfolder]: For 3127/3213 co-relation queries the response was YES. [2020-10-16 05:06:59,822 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3594 conditions, 653 events. 278/653 cut-off events. For 3127/3213 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3979 event pairs, 18 based on Foata normal form. 50/699 useless extension candidates. Maximal degree in co-relation 3572. Up to 394 conditions per place. [2020-10-16 05:06:59,824 INFO L132 encePairwiseOnDemand]: 179/187 looper letters, 58 selfloop transitions, 28 changer transitions 32/125 dead transitions. [2020-10-16 05:06:59,824 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 125 transitions, 1369 flow [2020-10-16 05:06:59,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 05:06:59,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 05:06:59,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 991 transitions. [2020-10-16 05:06:59,828 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6624331550802139 [2020-10-16 05:06:59,828 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 991 transitions. [2020-10-16 05:06:59,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 991 transitions. [2020-10-16 05:06:59,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:06:59,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 991 transitions. [2020-10-16 05:06:59,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 05:06:59,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 05:06:59,834 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 05:06:59,834 INFO L185 Difference]: Start difference. First operand has 73 places, 80 transitions, 746 flow. Second operand 8 states and 991 transitions. [2020-10-16 05:06:59,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 125 transitions, 1369 flow [2020-10-16 05:06:59,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 125 transitions, 1313 flow, removed 18 selfloop flow, removed 4 redundant places. [2020-10-16 05:06:59,849 INFO L241 Difference]: Finished difference. Result has 78 places, 86 transitions, 852 flow [2020-10-16 05:06:59,849 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=852, PETRI_PLACES=78, PETRI_TRANSITIONS=86} [2020-10-16 05:06:59,850 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 49 predicate places. [2020-10-16 05:06:59,850 INFO L481 AbstractCegarLoop]: Abstraction has has 78 places, 86 transitions, 852 flow [2020-10-16 05:06:59,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 05:06:59,850 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:06:59,850 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 05:06:59,850 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 05:06:59,850 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:06:59,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:06:59,851 INFO L82 PathProgramCache]: Analyzing trace with hash -607396330, now seen corresponding path program 6 times [2020-10-16 05:06:59,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:06:59,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914968212] [2020-10-16 05:06:59,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:06:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:00,182 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 05:07:00,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914968212] [2020-10-16 05:07:00,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:00,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:07:00,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151586890] [2020-10-16 05:07:00,184 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:07:00,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:00,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:07:00,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:07:00,190 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 187 [2020-10-16 05:07:00,191 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 86 transitions, 852 flow. Second operand 7 states. [2020-10-16 05:07:00,191 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:00,191 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 187 [2020-10-16 05:07:00,191 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:00,513 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2020-10-16 05:07:00,762 INFO L129 PetriNetUnfolder]: 232/644 cut-off events. [2020-10-16 05:07:00,762 INFO L130 PetriNetUnfolder]: For 3811/3921 co-relation queries the response was YES. [2020-10-16 05:07:00,766 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3521 conditions, 644 events. 232/644 cut-off events. For 3811/3921 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4494 event pairs, 6 based on Foata normal form. 32/670 useless extension candidates. Maximal degree in co-relation 3497. Up to 299 conditions per place. [2020-10-16 05:07:00,768 INFO L132 encePairwiseOnDemand]: 180/187 looper letters, 24 selfloop transitions, 17 changer transitions 39/111 dead transitions. [2020-10-16 05:07:00,769 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 111 transitions, 1236 flow [2020-10-16 05:07:00,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 05:07:00,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 05:07:00,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 733 transitions. [2020-10-16 05:07:00,777 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6532976827094474 [2020-10-16 05:07:00,777 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 733 transitions. [2020-10-16 05:07:00,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 733 transitions. [2020-10-16 05:07:00,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:00,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 733 transitions. [2020-10-16 05:07:00,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 05:07:00,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 05:07:00,781 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 05:07:00,781 INFO L185 Difference]: Start difference. First operand has 78 places, 86 transitions, 852 flow. Second operand 6 states and 733 transitions. [2020-10-16 05:07:00,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 111 transitions, 1236 flow [2020-10-16 05:07:00,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 111 transitions, 1182 flow, removed 16 selfloop flow, removed 4 redundant places. [2020-10-16 05:07:00,800 INFO L241 Difference]: Finished difference. Result has 79 places, 68 transitions, 741 flow [2020-10-16 05:07:00,801 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=741, PETRI_PLACES=79, PETRI_TRANSITIONS=68} [2020-10-16 05:07:00,801 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 50 predicate places. [2020-10-16 05:07:00,801 INFO L481 AbstractCegarLoop]: Abstraction has has 79 places, 68 transitions, 741 flow [2020-10-16 05:07:00,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:07:00,802 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:00,802 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 05:07:00,803 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 05:07:00,804 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:00,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:00,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1578887288, now seen corresponding path program 7 times [2020-10-16 05:07:00,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:00,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874743694] [2020-10-16 05:07:00,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:01,275 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 05:07:01,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874743694] [2020-10-16 05:07:01,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:01,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-16 05:07:01,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098665800] [2020-10-16 05:07:01,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-16 05:07:01,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:01,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-16 05:07:01,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-10-16 05:07:01,279 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 187 [2020-10-16 05:07:01,279 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 68 transitions, 741 flow. Second operand 13 states. [2020-10-16 05:07:01,280 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:01,280 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 187 [2020-10-16 05:07:01,280 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:01,969 INFO L129 PetriNetUnfolder]: 69/190 cut-off events. [2020-10-16 05:07:01,970 INFO L130 PetriNetUnfolder]: For 1296/1347 co-relation queries the response was YES. [2020-10-16 05:07:01,970 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 190 events. 69/190 cut-off events. For 1296/1347 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 808 event pairs, 2 based on Foata normal form. 21/211 useless extension candidates. Maximal degree in co-relation 1125. Up to 82 conditions per place. [2020-10-16 05:07:01,972 INFO L132 encePairwiseOnDemand]: 177/187 looper letters, 26 selfloop transitions, 50 changer transitions 11/92 dead transitions. [2020-10-16 05:07:01,972 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 92 transitions, 1137 flow [2020-10-16 05:07:01,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 05:07:01,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 05:07:01,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1232 transitions. [2020-10-16 05:07:01,976 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5989304812834224 [2020-10-16 05:07:01,976 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1232 transitions. [2020-10-16 05:07:01,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1232 transitions. [2020-10-16 05:07:01,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:01,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1232 transitions. [2020-10-16 05:07:01,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 05:07:01,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 05:07:01,983 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 05:07:01,983 INFO L185 Difference]: Start difference. First operand has 79 places, 68 transitions, 741 flow. Second operand 11 states and 1232 transitions. [2020-10-16 05:07:01,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 92 transitions, 1137 flow [2020-10-16 05:07:01,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 92 transitions, 1035 flow, removed 21 selfloop flow, removed 12 redundant places. [2020-10-16 05:07:01,992 INFO L241 Difference]: Finished difference. Result has 79 places, 78 transitions, 926 flow [2020-10-16 05:07:01,992 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=926, PETRI_PLACES=79, PETRI_TRANSITIONS=78} [2020-10-16 05:07:01,992 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 50 predicate places. [2020-10-16 05:07:01,992 INFO L481 AbstractCegarLoop]: Abstraction has has 79 places, 78 transitions, 926 flow [2020-10-16 05:07:01,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-16 05:07:01,992 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:01,993 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 05:07:01,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 05:07:01,993 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:01,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:01,993 INFO L82 PathProgramCache]: Analyzing trace with hash 941893004, now seen corresponding path program 8 times [2020-10-16 05:07:01,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:01,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817910266] [2020-10-16 05:07:01,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:02,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:07:02,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817910266] [2020-10-16 05:07:02,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:02,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 05:07:02,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391031024] [2020-10-16 05:07:02,405 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 05:07:02,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:02,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 05:07:02,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-16 05:07:02,407 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 187 [2020-10-16 05:07:02,407 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 78 transitions, 926 flow. Second operand 9 states. [2020-10-16 05:07:02,407 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:02,408 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 187 [2020-10-16 05:07:02,408 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:02,791 INFO L129 PetriNetUnfolder]: 64/196 cut-off events. [2020-10-16 05:07:02,792 INFO L130 PetriNetUnfolder]: For 1650/1679 co-relation queries the response was YES. [2020-10-16 05:07:02,793 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1191 conditions, 196 events. 64/196 cut-off events. For 1650/1679 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 908 event pairs, 2 based on Foata normal form. 10/206 useless extension candidates. Maximal degree in co-relation 1170. Up to 82 conditions per place. [2020-10-16 05:07:02,794 INFO L132 encePairwiseOnDemand]: 181/187 looper letters, 14 selfloop transitions, 13 changer transitions 33/86 dead transitions. [2020-10-16 05:07:02,794 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 86 transitions, 1103 flow [2020-10-16 05:07:02,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 05:07:02,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 05:07:02,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 960 transitions. [2020-10-16 05:07:02,798 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6417112299465241 [2020-10-16 05:07:02,798 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 960 transitions. [2020-10-16 05:07:02,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 960 transitions. [2020-10-16 05:07:02,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:02,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 960 transitions. [2020-10-16 05:07:02,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 05:07:02,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 05:07:02,804 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 05:07:02,804 INFO L185 Difference]: Start difference. First operand has 79 places, 78 transitions, 926 flow. Second operand 8 states and 960 transitions. [2020-10-16 05:07:02,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 86 transitions, 1103 flow [2020-10-16 05:07:02,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 86 transitions, 1018 flow, removed 25 selfloop flow, removed 4 redundant places. [2020-10-16 05:07:02,814 INFO L241 Difference]: Finished difference. Result has 83 places, 53 transitions, 577 flow [2020-10-16 05:07:02,815 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=577, PETRI_PLACES=83, PETRI_TRANSITIONS=53} [2020-10-16 05:07:02,815 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 54 predicate places. [2020-10-16 05:07:02,815 INFO L481 AbstractCegarLoop]: Abstraction has has 83 places, 53 transitions, 577 flow [2020-10-16 05:07:02,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 05:07:02,815 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:02,816 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 05:07:02,817 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 05:07:02,818 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:02,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:02,818 INFO L82 PathProgramCache]: Analyzing trace with hash -736453860, now seen corresponding path program 9 times [2020-10-16 05:07:02,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:02,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17732465] [2020-10-16 05:07:02,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:07:02,898 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:07:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:07:02,980 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:07:03,049 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 05:07:03,049 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 05:07:03,050 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 05:07:03,096 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 05:07:03,097 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,097 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 05:07:03,097 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,097 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 05:07:03,098 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,098 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 05:07:03,098 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,098 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 05:07:03,098 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,099 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 05:07:03,099 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,099 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 05:07:03,099 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,099 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 05:07:03,100 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,100 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 05:07:03,100 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,101 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 05:07:03,101 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,101 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 05:07:03,101 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,102 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 05:07:03,102 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,102 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 05:07:03,102 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,102 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 05:07:03,103 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,103 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 05:07:03,103 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,103 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 05:07:03,104 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,104 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 05:07:03,104 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,106 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 05:07:03,106 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,107 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 05:07:03,107 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,112 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 05:07:03,113 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,113 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 05:07:03,113 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,113 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 05:07:03,114 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,114 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 05:07:03,114 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,114 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 05:07:03,115 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,115 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 05:07:03,115 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,116 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 05:07:03,116 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,116 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 05:07:03,116 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,118 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 05:07:03,118 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,119 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 05:07:03,119 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,119 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 05:07:03,119 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,119 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 05:07:03,119 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,120 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 05:07:03,120 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,121 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 05:07:03,121 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,121 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 05:07:03,121 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,121 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 05:07:03,122 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,122 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 05:07:03,122 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,123 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 05:07:03,123 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,123 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 05:07:03,123 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,123 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 05:07:03,124 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,124 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 05:07:03,124 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,124 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 05:07:03,124 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,126 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 05:07:03,126 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,126 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 05:07:03,127 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,127 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 05:07:03,127 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,127 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 05:07:03,127 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,128 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 05:07:03,128 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,128 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 05:07:03,128 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:07:03,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 05:07:03 BasicIcfg [2020-10-16 05:07:03,251 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 05:07:03,253 INFO L168 Benchmark]: Toolchain (without parser) took 23337.25 ms. Allocated memory was 251.1 MB in the beginning and 750.3 MB in the end (delta: 499.1 MB). Free memory was 205.6 MB in the beginning and 163.5 MB in the end (delta: 42.1 MB). Peak memory consumption was 541.2 MB. Max. memory is 14.2 GB. [2020-10-16 05:07:03,253 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 251.1 MB. Free memory is still 227.5 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 05:07:03,254 INFO L168 Benchmark]: CACSL2BoogieTranslator took 762.74 ms. Allocated memory was 251.1 MB in the beginning and 313.0 MB in the end (delta: 61.9 MB). Free memory was 205.6 MB in the beginning and 261.0 MB in the end (delta: -55.4 MB). Peak memory consumption was 32.1 MB. Max. memory is 14.2 GB. [2020-10-16 05:07:03,255 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.54 ms. Allocated memory is still 313.0 MB. Free memory was 261.0 MB in the beginning and 258.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:07:03,258 INFO L168 Benchmark]: Boogie Preprocessor took 46.45 ms. Allocated memory is still 313.0 MB. Free memory was 258.5 MB in the beginning and 256.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:07:03,259 INFO L168 Benchmark]: RCFGBuilder took 3082.27 ms. Allocated memory was 313.0 MB in the beginning and 372.2 MB in the end (delta: 59.2 MB). Free memory was 256.0 MB in the beginning and 257.9 MB in the end (delta: -2.0 MB). Peak memory consumption was 145.0 MB. Max. memory is 14.2 GB. [2020-10-16 05:07:03,261 INFO L168 Benchmark]: TraceAbstraction took 19376.78 ms. Allocated memory was 372.2 MB in the beginning and 750.3 MB in the end (delta: 378.0 MB). Free memory was 257.9 MB in the beginning and 163.5 MB in the end (delta: 94.4 MB). Peak memory consumption was 472.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:07:03,268 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.47 ms. Allocated memory is still 251.1 MB. Free memory is still 227.5 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 762.74 ms. Allocated memory was 251.1 MB in the beginning and 313.0 MB in the end (delta: 61.9 MB). Free memory was 205.6 MB in the beginning and 261.0 MB in the end (delta: -55.4 MB). Peak memory consumption was 32.1 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 63.54 ms. Allocated memory is still 313.0 MB. Free memory was 261.0 MB in the beginning and 258.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 46.45 ms. Allocated memory is still 313.0 MB. Free memory was 258.5 MB in the beginning and 256.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 3082.27 ms. Allocated memory was 313.0 MB in the beginning and 372.2 MB in the end (delta: 59.2 MB). Free memory was 256.0 MB in the beginning and 257.9 MB in the end (delta: -2.0 MB). Peak memory consumption was 145.0 MB. Max. memory is 14.2 GB. * TraceAbstraction took 19376.78 ms. Allocated memory was 372.2 MB in the beginning and 750.3 MB in the end (delta: 378.0 MB). Free memory was 257.9 MB in the beginning and 163.5 MB in the end (delta: 94.4 MB). Peak memory consumption was 472.5 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 617 VarBasedMoverChecksPositive, 73 VarBasedMoverChecksNegative, 28 SemBasedMoverChecksPositive, 45 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 72 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.3s, 102 PlacesBefore, 29 PlacesAfterwards, 93 TransitionsBefore, 20 TransitionsAfterwards, 954 CoEnabledTransitionPairs, 7 FixpointIterations, 49 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 0 ChoiceCompositions, 80 TotalNumberOfCompositions, 2760 MoverChecksTotal - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p2_EAX = 0; [L704] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L705] 0 int __unbuffered_p2_EAX$mem_tmp; [L706] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L707] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L708] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L709] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L710] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L711] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L712] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L713] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L714] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L715] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L716] 0 int __unbuffered_p2_EAX$w_buff0; [L717] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L718] 0 int __unbuffered_p2_EAX$w_buff1; [L719] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L724] 0 _Bool x$flush_delayed; [L725] 0 int x$mem_tmp; [L726] 0 _Bool x$r_buff0_thd0; [L727] 0 _Bool x$r_buff0_thd1; [L728] 0 _Bool x$r_buff0_thd2; [L729] 0 _Bool x$r_buff0_thd3; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$read_delayed; [L735] 0 int *x$read_delayed_var; [L736] 0 int x$w_buff0; [L737] 0 _Bool x$w_buff0_used; [L738] 0 int x$w_buff1; [L739] 0 _Bool x$w_buff1_used; [L741] 0 int y = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice1; [L744] 0 _Bool weak$$choice2; [L838] 0 pthread_t t2269; [L839] FCALL, FORK 0 pthread_create(&t2269, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L840] 0 pthread_t t2270; [L841] FCALL, FORK 0 pthread_create(&t2270, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L842] 0 pthread_t t2271; [L843] FCALL, FORK 0 pthread_create(&t2271, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L795] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 3 x$flush_delayed = weak$$choice2 [L798] EXPR 3 \read(x) [L798] 3 x$mem_tmp = x [L799] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1 [L799] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L799] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L800] EXPR 3 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L800] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0) [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0 [L800] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0) [L800] EXPR 3 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L800] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L801] EXPR 3 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L801] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L802] EXPR 3 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L802] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used) [L802] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L802] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used) [L802] EXPR 3 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L802] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L803] EXPR 3 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L803] EXPR 3 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 3 weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L804] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3) [L804] EXPR 3 weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L804] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L805] EXPR 3 weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L805] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L805] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L805] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L805] EXPR 3 weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L805] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L807] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L808] EXPR 3 \read(x) [L808] 3 __unbuffered_p2_EAX = x [L809] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L809] 3 x = x$flush_delayed ? x$mem_tmp : x [L810] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=10, weak$$choice1=0, weak$$choice2=255, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L813] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=10, weak$$choice1=0, weak$$choice2=255, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L816] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L816] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L817] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L818] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L819] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L820] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L748] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=10, weak$$choice1=0, weak$$choice2=255, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L753] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 1 x$flush_delayed = weak$$choice2 [L756] EXPR 1 \read(x) [L756] 1 x$mem_tmp = x [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1 [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L757] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L758] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L758] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L759] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L759] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L759] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L759] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L760] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L760] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L761] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L761] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L761] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L762] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L763] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L763] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0 [L763] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L763] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] EXPR 1 \read(x) [L764] 1 __unbuffered_p0_EAX = x [L765] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L765] 1 x = x$flush_delayed ? x$mem_tmp : x [L766] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=8, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=8, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L785] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L785] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L825] 3 return 0; [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=8, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND FALSE 0 !(!cond) [L849] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L849] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L850] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L850] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L851] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L851] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L852] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L852] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L853] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L853] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L856] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L857] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L857] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L858] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$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=8, weak$$choice1=255, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 18.9s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.5s, HoareTripleCheckerStatistics: 87 SDtfs, 60 SDslu, 131 SDs, 0 SdLazy, 1620 SolverSat, 251 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=926occurred in iteration=16, 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.7s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 244 ConstructedInterpolants, 0 QuantifiedInterpolants, 75229 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...