/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:30:45,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:30:45,399 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:30:45,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:30:45,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:30:45,446 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:30:45,449 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:30:45,453 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:30:45,456 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:30:45,459 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:30:45,460 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:30:45,461 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:30:45,461 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:30:45,464 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:30:45,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:30:45,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:30:45,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:30:45,470 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:30:45,472 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:30:45,480 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:30:45,482 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:30:45,483 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:30:45,484 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:30:45,484 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:30:45,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:30:45,496 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:30:45,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:30:45,503 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:30:45,503 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:30:45,504 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:30:45,504 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:30:45,505 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:30:45,509 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:30:45,510 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:30:45,510 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:30:45,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:30:45,511 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:30:45,511 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:30:45,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:30:45,512 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:30:45,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:30:45,516 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2020-10-16 01:30:45,556 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:30:45,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:30:45,558 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:30:45,561 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:30:45,561 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:30:45,561 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:30:45,562 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:30:45,562 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:30:45,562 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:30:45,562 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:30:45,562 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:30:45,562 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:30:45,562 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:30:45,563 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:30:45,563 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:30:45,563 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:30:45,563 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:30:45,563 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:30:45,563 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:30:45,563 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:30:45,564 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:30:45,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:30:45,568 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:30:45,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:30:45,568 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:30:45,568 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:30:45,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:30:45,569 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:30:45,569 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:30:45,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:30:45,863 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:30:45,868 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:30:45,869 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:30:45,871 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:30:45,872 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_rmo.oepc.i [2020-10-16 01:30:45,961 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d02c758fb/afc173d3e5084094aa91198e7535f73c/FLAGdb77177d4 [2020-10-16 01:30:46,487 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:30:46,488 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_rmo.oepc.i [2020-10-16 01:30:46,501 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d02c758fb/afc173d3e5084094aa91198e7535f73c/FLAGdb77177d4 [2020-10-16 01:30:46,769 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d02c758fb/afc173d3e5084094aa91198e7535f73c [2020-10-16 01:30:46,779 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:30:46,780 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:30:46,781 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:30:46,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:30:46,785 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:30:46,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:30:46" (1/1) ... [2020-10-16 01:30:46,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@120f1139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:46, skipping insertion in model container [2020-10-16 01:30:46,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:30:46" (1/1) ... [2020-10-16 01:30:46,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:30:46,848 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:30:47,323 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:30:47,339 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:30:47,424 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:30:47,510 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:30:47,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:47 WrapperNode [2020-10-16 01:30:47,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:30:47,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:30:47,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:30:47,512 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:30:47,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:47" (1/1) ... [2020-10-16 01:30:47,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:47" (1/1) ... [2020-10-16 01:30:47,573 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:30:47,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:30:47,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:30:47,574 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:30:47,582 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:47" (1/1) ... [2020-10-16 01:30:47,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:47" (1/1) ... [2020-10-16 01:30:47,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:47" (1/1) ... [2020-10-16 01:30:47,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:47" (1/1) ... [2020-10-16 01:30:47,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:47" (1/1) ... [2020-10-16 01:30:47,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:47" (1/1) ... [2020-10-16 01:30:47,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:47" (1/1) ... [2020-10-16 01:30:47,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:30:47,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:30:47,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:30:47,615 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:30:47,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:30:47,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:30:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:30:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:30:47,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:30:47,687 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:30:47,687 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:30:47,688 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:30:47,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:30:47,688 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:30:47,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:30:47,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:30:47,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:30:47,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:30:47,691 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 01:30:49,711 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:30:49,711 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:30:49,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:30:49 BoogieIcfgContainer [2020-10-16 01:30:49,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:30:49,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:30:49,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:30:49,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:30:49,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:30:46" (1/3) ... [2020-10-16 01:30:49,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f66d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:30:49, skipping insertion in model container [2020-10-16 01:30:49,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:30:47" (2/3) ... [2020-10-16 01:30:49,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f66d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:30:49, skipping insertion in model container [2020-10-16 01:30:49,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:30:49" (3/3) ... [2020-10-16 01:30:49,723 INFO L111 eAbstractionObserver]: Analyzing ICFG mix056_rmo.oepc.i [2020-10-16 01:30:49,736 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:30:49,744 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:30:49,745 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:30:49,781 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,781 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,782 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,782 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,783 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,783 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,783 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,783 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,784 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,784 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,784 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,784 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,784 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,785 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,785 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,785 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,786 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,787 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,787 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,789 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,790 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,790 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,791 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,791 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,791 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,791 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,791 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,792 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,792 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,792 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,792 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,792 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,792 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,793 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,793 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,793 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,793 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,793 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,793 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,794 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,794 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,794 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,794 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,794 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,794 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,805 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,805 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,805 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,806 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,806 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,806 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,807 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,807 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,808 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,810 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,811 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,811 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,811 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,812 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,812 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,812 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,812 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,812 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,813 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,815 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,815 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,815 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,816 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,816 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,818 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,819 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,819 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,819 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,819 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,822 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,822 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,822 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:30:49,840 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 01:30:49,862 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:30:49,862 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:30:49,862 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:30:49,862 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:30:49,862 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:30:49,863 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:30:49,863 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:30:49,863 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:30:49,877 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-16 01:30:49,926 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-16 01:30:49,926 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:30:49,934 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 01:30:49,934 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 92 transitions, 199 flow [2020-10-16 01:30:49,941 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 89 transitions, 187 flow [2020-10-16 01:30:49,944 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:30:49,947 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 89 transitions, 187 flow [2020-10-16 01:30:49,951 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 89 transitions, 187 flow [2020-10-16 01:30:49,951 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 97 places, 89 transitions, 187 flow [2020-10-16 01:30:49,975 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-16 01:30:49,976 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:30:49,977 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 01:30:50,019 INFO L117 LiptonReduction]: Number of co-enabled transitions 1650 [2020-10-16 01:30:50,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:50,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:50,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:50,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:50,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:50,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:50,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:50,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:50,449 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:50,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:50,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:50,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:50,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:50,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:50,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:50,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:50,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:50,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:50,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:50,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:50,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:50,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:50,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:50,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:50,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:50,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:50,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:50,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:50,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:50,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:50,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:50,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:50,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:50,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:50,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:50,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:50,800 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:50,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:50,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:50,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:50,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:50,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:50,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:50,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:50,826 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:50,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:50,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:50,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:50,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:50,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:50,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:30:50,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:30:50,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:30:50,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:30:50,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:30:50,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:30:50,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:30:50,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:50,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:30:50,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:50,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:30:50,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:50,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:30:50,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:30:50,951 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:30:50,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:50,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:50,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:50,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:50,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:50,988 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:50,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:50,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:50,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:51,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:51,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:51,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:51,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:51,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:51,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:51,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:51,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:51,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:51,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:51,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:51,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:51,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:51,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:51,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:51,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:51,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:51,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:51,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:51,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:51,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:51,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:51,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:51,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:51,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:30:51,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:51,418 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:30:51,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:30:51,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:30:51,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:51,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:51,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:51,461 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:30:51,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:30:51,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:30:51,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:30:51,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:30:51,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:30:51,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:30:51,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:51,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:30:51,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:51,470 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 01:30:51,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:30:51,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:51,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:51,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:51,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:51,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:51,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:51,621 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:51,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:51,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:51,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:51,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:51,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:30:51,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:30:51,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:51,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:30:51,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:30:52,462 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-10-16 01:30:52,587 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-10-16 01:30:52,811 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-16 01:30:52,920 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-16 01:30:52,928 INFO L132 LiptonReduction]: Checked pairs total: 4463 [2020-10-16 01:30:52,928 INFO L134 LiptonReduction]: Total number of compositions: 75 [2020-10-16 01:30:52,942 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3001 [2020-10-16 01:30:52,948 INFO L129 PetriNetUnfolder]: 0/3 cut-off events. [2020-10-16 01:30:52,948 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:30:52,948 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:52,949 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2020-10-16 01:30:52,950 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:52,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:52,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1040131, now seen corresponding path program 1 times [2020-10-16 01:30:52,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:52,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802925611] [2020-10-16 01:30:52,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:53,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:53,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:30:53,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802925611] [2020-10-16 01:30:53,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:53,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:30:53,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034076750] [2020-10-16 01:30:53,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:30:53,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:53,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:30:53,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:30:53,292 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 167 [2020-10-16 01:30:53,294 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states. [2020-10-16 01:30:53,294 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:53,294 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 167 [2020-10-16 01:30:53,296 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:53,388 INFO L129 PetriNetUnfolder]: 49/125 cut-off events. [2020-10-16 01:30:53,388 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:30:53,389 INFO L80 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 125 events. 49/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 516 event pairs, 38 based on Foata normal form. 17/137 useless extension candidates. Maximal degree in co-relation 211. Up to 65 conditions per place. [2020-10-16 01:30:53,391 INFO L132 encePairwiseOnDemand]: 163/167 looper letters, 9 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2020-10-16 01:30:53,392 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 27 transitions, 85 flow [2020-10-16 01:30:53,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:30:53,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:30:53,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2020-10-16 01:30:53,410 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8782435129740519 [2020-10-16 01:30:53,411 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2020-10-16 01:30:53,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2020-10-16 01:30:53,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:53,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2020-10-16 01:30:53,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:30:53,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:30:53,429 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:30:53,431 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 440 transitions. [2020-10-16 01:30:53,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 27 transitions, 85 flow [2020-10-16 01:30:53,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 82 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 01:30:53,437 INFO L241 Difference]: Finished difference. Result has 32 places, 23 transitions, 56 flow [2020-10-16 01:30:53,440 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2020-10-16 01:30:53,442 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2020-10-16 01:30:53,442 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2020-10-16 01:30:53,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:30:53,442 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:53,442 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:53,443 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:30:53,443 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:53,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:53,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1428149418, now seen corresponding path program 1 times [2020-10-16 01:30:53,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:53,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28284290] [2020-10-16 01:30:53,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:53,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:30:53,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28284290] [2020-10-16 01:30:53,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:53,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:30:53,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56704214] [2020-10-16 01:30:53,515 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:30:53,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:53,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:30:53,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:30:53,518 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 167 [2020-10-16 01:30:53,519 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand 3 states. [2020-10-16 01:30:53,519 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:53,519 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 167 [2020-10-16 01:30:53,519 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:53,547 INFO L129 PetriNetUnfolder]: 14/63 cut-off events. [2020-10-16 01:30:53,547 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:30:53,547 INFO L80 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 63 events. 14/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 206 event pairs, 6 based on Foata normal form. 1/58 useless extension candidates. Maximal degree in co-relation 94. Up to 29 conditions per place. [2020-10-16 01:30:53,548 INFO L132 encePairwiseOnDemand]: 162/167 looper letters, 4 selfloop transitions, 4 changer transitions 0/26 dead transitions. [2020-10-16 01:30:53,548 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 26 transitions, 78 flow [2020-10-16 01:30:53,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:30:53,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:30:53,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2020-10-16 01:30:53,551 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8562874251497006 [2020-10-16 01:30:53,551 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2020-10-16 01:30:53,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2020-10-16 01:30:53,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:53,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2020-10-16 01:30:53,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:30:53,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:30:53,555 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:30:53,555 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 3 states and 429 transitions. [2020-10-16 01:30:53,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 26 transitions, 78 flow [2020-10-16 01:30:53,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 26 transitions, 74 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:30:53,557 INFO L241 Difference]: Finished difference. Result has 33 places, 26 transitions, 78 flow [2020-10-16 01:30:53,557 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2020-10-16 01:30:53,558 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2020-10-16 01:30:53,558 INFO L481 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 78 flow [2020-10-16 01:30:53,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:30:53,559 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:53,559 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:53,559 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:30:53,559 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:53,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:53,560 INFO L82 PathProgramCache]: Analyzing trace with hash -43508132, now seen corresponding path program 1 times [2020-10-16 01:30:53,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:53,561 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174329235] [2020-10-16 01:30:53,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:53,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:30:53,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174329235] [2020-10-16 01:30:53,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:53,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:30:53,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408350445] [2020-10-16 01:30:53,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:30:53,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:53,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:30:53,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:30:53,645 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 167 [2020-10-16 01:30:53,646 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 78 flow. Second operand 4 states. [2020-10-16 01:30:53,646 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:53,646 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 167 [2020-10-16 01:30:53,646 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:53,679 INFO L129 PetriNetUnfolder]: 8/50 cut-off events. [2020-10-16 01:30:53,679 INFO L130 PetriNetUnfolder]: For 7/16 co-relation queries the response was YES. [2020-10-16 01:30:53,679 INFO L80 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 50 events. 8/50 cut-off events. For 7/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 103 event pairs, 1 based on Foata normal form. 8/53 useless extension candidates. Maximal degree in co-relation 93. Up to 20 conditions per place. [2020-10-16 01:30:53,680 INFO L132 encePairwiseOnDemand]: 162/167 looper letters, 4 selfloop transitions, 7 changer transitions 0/29 dead transitions. [2020-10-16 01:30:53,680 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 112 flow [2020-10-16 01:30:53,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:30:53,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:30:53,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 572 transitions. [2020-10-16 01:30:53,683 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8562874251497006 [2020-10-16 01:30:53,683 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 572 transitions. [2020-10-16 01:30:53,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 572 transitions. [2020-10-16 01:30:53,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:53,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 572 transitions. [2020-10-16 01:30:53,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:30:53,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:30:53,686 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:30:53,686 INFO L185 Difference]: Start difference. First operand has 33 places, 26 transitions, 78 flow. Second operand 4 states and 572 transitions. [2020-10-16 01:30:53,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 112 flow [2020-10-16 01:30:53,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:30:53,688 INFO L241 Difference]: Finished difference. Result has 36 places, 29 transitions, 114 flow [2020-10-16 01:30:53,688 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2020-10-16 01:30:53,689 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2020-10-16 01:30:53,689 INFO L481 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 114 flow [2020-10-16 01:30:53,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:30:53,689 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:53,689 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:53,689 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:30:53,690 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:53,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:53,690 INFO L82 PathProgramCache]: Analyzing trace with hash -999101911, now seen corresponding path program 1 times [2020-10-16 01:30:53,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:53,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316933604] [2020-10-16 01:30:53,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:53,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:30:53,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316933604] [2020-10-16 01:30:53,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:53,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:30:53,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266359689] [2020-10-16 01:30:53,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:30:53,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:53,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:30:53,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:30:53,767 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 167 [2020-10-16 01:30:53,768 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 114 flow. Second operand 5 states. [2020-10-16 01:30:53,768 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:53,768 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 167 [2020-10-16 01:30:53,768 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:53,810 INFO L129 PetriNetUnfolder]: 5/32 cut-off events. [2020-10-16 01:30:53,811 INFO L130 PetriNetUnfolder]: For 31/51 co-relation queries the response was YES. [2020-10-16 01:30:53,811 INFO L80 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 32 events. 5/32 cut-off events. For 31/51 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 13/43 useless extension candidates. Maximal degree in co-relation 79. Up to 14 conditions per place. [2020-10-16 01:30:53,811 INFO L132 encePairwiseOnDemand]: 162/167 looper letters, 1 selfloop transitions, 10 changer transitions 1/29 dead transitions. [2020-10-16 01:30:53,812 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 136 flow [2020-10-16 01:30:53,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:30:53,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:30:53,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 712 transitions. [2020-10-16 01:30:53,817 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8526946107784431 [2020-10-16 01:30:53,817 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 712 transitions. [2020-10-16 01:30:53,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 712 transitions. [2020-10-16 01:30:53,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:53,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 712 transitions. [2020-10-16 01:30:53,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:30:53,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:30:53,821 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:30:53,822 INFO L185 Difference]: Start difference. First operand has 36 places, 29 transitions, 114 flow. Second operand 5 states and 712 transitions. [2020-10-16 01:30:53,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 136 flow [2020-10-16 01:30:53,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 122 flow, removed 3 selfloop flow, removed 2 redundant places. [2020-10-16 01:30:53,826 INFO L241 Difference]: Finished difference. Result has 39 places, 28 transitions, 126 flow [2020-10-16 01:30:53,826 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2020-10-16 01:30:53,827 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2020-10-16 01:30:53,827 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 126 flow [2020-10-16 01:30:53,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:30:53,829 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:53,829 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:53,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:30:53,830 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:53,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:53,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1830617222, now seen corresponding path program 1 times [2020-10-16 01:30:53,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:53,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788277688] [2020-10-16 01:30:53,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:54,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:30:54,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788277688] [2020-10-16 01:30:54,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:54,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:30:54,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489621089] [2020-10-16 01:30:54,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:30:54,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:54,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:30:54,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:30:54,219 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 167 [2020-10-16 01:30:54,219 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 126 flow. Second operand 8 states. [2020-10-16 01:30:54,220 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:54,220 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 167 [2020-10-16 01:30:54,220 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:54,524 INFO L129 PetriNetUnfolder]: 42/138 cut-off events. [2020-10-16 01:30:54,524 INFO L130 PetriNetUnfolder]: For 143/156 co-relation queries the response was YES. [2020-10-16 01:30:54,525 INFO L80 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 138 events. 42/138 cut-off events. For 143/156 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 566 event pairs, 3 based on Foata normal form. 2/137 useless extension candidates. Maximal degree in co-relation 368. Up to 43 conditions per place. [2020-10-16 01:30:54,526 INFO L132 encePairwiseOnDemand]: 159/167 looper letters, 15 selfloop transitions, 6 changer transitions 5/45 dead transitions. [2020-10-16 01:30:54,527 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 212 flow [2020-10-16 01:30:54,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:30:54,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:30:54,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 797 transitions. [2020-10-16 01:30:54,530 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6817792985457656 [2020-10-16 01:30:54,530 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 797 transitions. [2020-10-16 01:30:54,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 797 transitions. [2020-10-16 01:30:54,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:54,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 797 transitions. [2020-10-16 01:30:54,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:30:54,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:30:54,535 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:30:54,535 INFO L185 Difference]: Start difference. First operand has 39 places, 28 transitions, 126 flow. Second operand 7 states and 797 transitions. [2020-10-16 01:30:54,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 212 flow [2020-10-16 01:30:54,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 186 flow, removed 6 selfloop flow, removed 3 redundant places. [2020-10-16 01:30:54,539 INFO L241 Difference]: Finished difference. Result has 45 places, 32 transitions, 140 flow [2020-10-16 01:30:54,539 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2020-10-16 01:30:54,539 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2020-10-16 01:30:54,539 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 140 flow [2020-10-16 01:30:54,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:30:54,540 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:54,540 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:54,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:30:54,540 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:54,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:54,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1214934864, now seen corresponding path program 2 times [2020-10-16 01:30:54,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:54,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71747103] [2020-10-16 01:30:54,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:54,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:30:54,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71747103] [2020-10-16 01:30:54,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:54,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:30:54,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133486155] [2020-10-16 01:30:54,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:30:54,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:54,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:30:54,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:30:54,667 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 167 [2020-10-16 01:30:54,668 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 140 flow. Second operand 4 states. [2020-10-16 01:30:54,669 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:54,669 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 167 [2020-10-16 01:30:54,669 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:54,723 INFO L129 PetriNetUnfolder]: 70/222 cut-off events. [2020-10-16 01:30:54,723 INFO L130 PetriNetUnfolder]: For 131/134 co-relation queries the response was YES. [2020-10-16 01:30:54,725 INFO L80 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 222 events. 70/222 cut-off events. For 131/134 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1145 event pairs, 24 based on Foata normal form. 3/213 useless extension candidates. Maximal degree in co-relation 556. Up to 80 conditions per place. [2020-10-16 01:30:54,726 INFO L132 encePairwiseOnDemand]: 163/167 looper letters, 3 selfloop transitions, 2 changer transitions 2/34 dead transitions. [2020-10-16 01:30:54,726 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 34 transitions, 160 flow [2020-10-16 01:30:54,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:30:54,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:30:54,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 552 transitions. [2020-10-16 01:30:54,728 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8263473053892215 [2020-10-16 01:30:54,729 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 552 transitions. [2020-10-16 01:30:54,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 552 transitions. [2020-10-16 01:30:54,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:54,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 552 transitions. [2020-10-16 01:30:54,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:30:54,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:30:54,732 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:30:54,732 INFO L185 Difference]: Start difference. First operand has 45 places, 32 transitions, 140 flow. Second operand 4 states and 552 transitions. [2020-10-16 01:30:54,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 34 transitions, 160 flow [2020-10-16 01:30:54,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 34 transitions, 148 flow, removed 3 selfloop flow, removed 4 redundant places. [2020-10-16 01:30:54,736 INFO L241 Difference]: Finished difference. Result has 44 places, 32 transitions, 140 flow [2020-10-16 01:30:54,736 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2020-10-16 01:30:54,736 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2020-10-16 01:30:54,736 INFO L481 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 140 flow [2020-10-16 01:30:54,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:30:54,737 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:54,737 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:54,737 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:30:54,737 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:54,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:54,738 INFO L82 PathProgramCache]: Analyzing trace with hash -109317802, now seen corresponding path program 3 times [2020-10-16 01:30:54,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:54,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129544964] [2020-10-16 01:30:54,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:54,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:30:54,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129544964] [2020-10-16 01:30:54,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:54,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:30:54,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337630810] [2020-10-16 01:30:54,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:30:54,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:54,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:30:54,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:30:54,809 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 167 [2020-10-16 01:30:54,809 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 140 flow. Second operand 4 states. [2020-10-16 01:30:54,810 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:54,810 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 167 [2020-10-16 01:30:54,810 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:54,853 INFO L129 PetriNetUnfolder]: 50/167 cut-off events. [2020-10-16 01:30:54,853 INFO L130 PetriNetUnfolder]: For 92/97 co-relation queries the response was YES. [2020-10-16 01:30:54,854 INFO L80 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 167 events. 50/167 cut-off events. For 92/97 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 726 event pairs, 15 based on Foata normal form. 3/163 useless extension candidates. Maximal degree in co-relation 419. Up to 60 conditions per place. [2020-10-16 01:30:54,855 INFO L132 encePairwiseOnDemand]: 163/167 looper letters, 3 selfloop transitions, 2 changer transitions 4/34 dead transitions. [2020-10-16 01:30:54,855 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 34 transitions, 160 flow [2020-10-16 01:30:54,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:30:54,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:30:54,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 552 transitions. [2020-10-16 01:30:54,857 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8263473053892215 [2020-10-16 01:30:54,858 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 552 transitions. [2020-10-16 01:30:54,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 552 transitions. [2020-10-16 01:30:54,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:54,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 552 transitions. [2020-10-16 01:30:54,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:30:54,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:30:54,861 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:30:54,861 INFO L185 Difference]: Start difference. First operand has 44 places, 32 transitions, 140 flow. Second operand 4 states and 552 transitions. [2020-10-16 01:30:54,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 34 transitions, 160 flow [2020-10-16 01:30:54,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 34 transitions, 150 flow, removed 3 selfloop flow, removed 3 redundant places. [2020-10-16 01:30:54,864 INFO L241 Difference]: Finished difference. Result has 45 places, 30 transitions, 132 flow [2020-10-16 01:30:54,864 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2020-10-16 01:30:54,864 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2020-10-16 01:30:54,865 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 132 flow [2020-10-16 01:30:54,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:30:54,865 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:54,865 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:54,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:30:54,865 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:54,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:54,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1500859892, now seen corresponding path program 4 times [2020-10-16 01:30:54,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:54,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467186237] [2020-10-16 01:30:54,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:30:55,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:30:55,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467186237] [2020-10-16 01:30:55,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:30:55,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:30:55,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739231103] [2020-10-16 01:30:55,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:30:55,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:30:55,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:30:55,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:30:55,076 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 167 [2020-10-16 01:30:55,077 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 132 flow. Second operand 8 states. [2020-10-16 01:30:55,077 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:30:55,077 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 167 [2020-10-16 01:30:55,077 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:30:55,297 INFO L129 PetriNetUnfolder]: 23/81 cut-off events. [2020-10-16 01:30:55,297 INFO L130 PetriNetUnfolder]: For 53/60 co-relation queries the response was YES. [2020-10-16 01:30:55,297 INFO L80 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 81 events. 23/81 cut-off events. For 53/60 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 236 event pairs, 0 based on Foata normal form. 2/81 useless extension candidates. Maximal degree in co-relation 225. Up to 26 conditions per place. [2020-10-16 01:30:55,298 INFO L132 encePairwiseOnDemand]: 159/167 looper letters, 10 selfloop transitions, 5 changer transitions 4/38 dead transitions. [2020-10-16 01:30:55,298 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 38 transitions, 200 flow [2020-10-16 01:30:55,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:30:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:30:55,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 922 transitions. [2020-10-16 01:30:55,302 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6901197604790419 [2020-10-16 01:30:55,302 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 922 transitions. [2020-10-16 01:30:55,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 922 transitions. [2020-10-16 01:30:55,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:30:55,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 922 transitions. [2020-10-16 01:30:55,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:30:55,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:30:55,307 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:30:55,308 INFO L185 Difference]: Start difference. First operand has 45 places, 30 transitions, 132 flow. Second operand 8 states and 922 transitions. [2020-10-16 01:30:55,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 38 transitions, 200 flow [2020-10-16 01:30:55,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 38 transitions, 186 flow, removed 5 selfloop flow, removed 4 redundant places. [2020-10-16 01:30:55,310 INFO L241 Difference]: Finished difference. Result has 50 places, 32 transitions, 153 flow [2020-10-16 01:30:55,311 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=153, PETRI_PLACES=50, PETRI_TRANSITIONS=32} [2020-10-16 01:30:55,311 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2020-10-16 01:30:55,311 INFO L481 AbstractCegarLoop]: Abstraction has has 50 places, 32 transitions, 153 flow [2020-10-16 01:30:55,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:30:55,311 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:30:55,311 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:30:55,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:30:55,312 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:30:55,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:30:55,312 INFO L82 PathProgramCache]: Analyzing trace with hash 980589212, now seen corresponding path program 5 times [2020-10-16 01:30:55,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:30:55,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913629047] [2020-10-16 01:30:55,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:30:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:30:55,386 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:30:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:30:55,485 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:30:55,522 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:30:55,523 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:30:55,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:30:55,542 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,543 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,545 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,545 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,545 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,545 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,545 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,545 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,546 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,546 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,546 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,546 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,547 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,547 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,548 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,548 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,548 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,548 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,548 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,548 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,549 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,549 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,549 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,549 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,549 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,549 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,550 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,550 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,550 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,550 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,550 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,550 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,551 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,551 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,551 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,551 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,552 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,552 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,552 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,552 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,552 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,552 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,553 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,553 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,553 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,553 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,553 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,554 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,554 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,554 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,554 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,554 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,554 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,554 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,555 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,555 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,556 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,556 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,556 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,557 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,557 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,557 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,557 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,557 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,557 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:30:55,558 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:30:55,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:30:55 BasicIcfg [2020-10-16 01:30:55,628 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:30:55,634 INFO L168 Benchmark]: Toolchain (without parser) took 8853.16 ms. Allocated memory was 253.8 MB in the beginning and 498.6 MB in the end (delta: 244.8 MB). Free memory was 206.6 MB in the beginning and 223.3 MB in the end (delta: -16.7 MB). Peak memory consumption was 228.2 MB. Max. memory is 14.2 GB. [2020-10-16 01:30:55,634 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 253.8 MB. Free memory is still 227.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:30:55,636 INFO L168 Benchmark]: CACSL2BoogieTranslator took 729.52 ms. Allocated memory was 253.8 MB in the beginning and 323.0 MB in the end (delta: 69.2 MB). Free memory was 206.6 MB in the beginning and 275.2 MB in the end (delta: -68.6 MB). Peak memory consumption was 33.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:30:55,637 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.38 ms. Allocated memory is still 323.0 MB. Free memory was 275.2 MB in the beginning and 272.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:30:55,638 INFO L168 Benchmark]: Boogie Preprocessor took 40.86 ms. Allocated memory is still 323.0 MB. Free memory was 272.7 MB in the beginning and 270.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:30:55,639 INFO L168 Benchmark]: RCFGBuilder took 2098.94 ms. Allocated memory was 323.0 MB in the beginning and 360.7 MB in the end (delta: 37.7 MB). Free memory was 270.2 MB in the beginning and 197.4 MB in the end (delta: 72.7 MB). Peak memory consumption was 110.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:30:55,641 INFO L168 Benchmark]: TraceAbstraction took 5913.51 ms. Allocated memory was 360.7 MB in the beginning and 498.6 MB in the end (delta: 137.9 MB). Free memory was 197.4 MB in the beginning and 223.3 MB in the end (delta: -25.8 MB). Peak memory consumption was 112.1 MB. Max. memory is 14.2 GB. [2020-10-16 01:30:55,648 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.51 ms. Allocated memory is still 253.8 MB. Free memory is still 227.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 729.52 ms. Allocated memory was 253.8 MB in the beginning and 323.0 MB in the end (delta: 69.2 MB). Free memory was 206.6 MB in the beginning and 275.2 MB in the end (delta: -68.6 MB). Peak memory consumption was 33.5 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 62.38 ms. Allocated memory is still 323.0 MB. Free memory was 275.2 MB in the beginning and 272.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 40.86 ms. Allocated memory is still 323.0 MB. Free memory was 272.7 MB in the beginning and 270.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2098.94 ms. Allocated memory was 323.0 MB in the beginning and 360.7 MB in the end (delta: 37.7 MB). Free memory was 270.2 MB in the beginning and 197.4 MB in the end (delta: 72.7 MB). Peak memory consumption was 110.5 MB. Max. memory is 14.2 GB. * TraceAbstraction took 5913.51 ms. Allocated memory was 360.7 MB in the beginning and 498.6 MB in the end (delta: 137.9 MB). Free memory was 197.4 MB in the beginning and 223.3 MB in the end (delta: -25.8 MB). Peak memory consumption was 112.1 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1020 VarBasedMoverChecksPositive, 55 VarBasedMoverChecksNegative, 22 SemBasedMoverChecksPositive, 33 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 103 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 2.9s, 97 PlacesBefore, 34 PlacesAfterwards, 89 TransitionsBefore, 25 TransitionsAfterwards, 1650 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 4463 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p2_EAX = 0; [L701] 0 _Bool main$tmp_guard0; [L702] 0 _Bool main$tmp_guard1; [L704] 0 int x = 0; [L706] 0 int y = 0; [L708] 0 int z = 0; [L709] 0 _Bool z$flush_delayed; [L710] 0 int z$mem_tmp; [L711] 0 _Bool z$r_buff0_thd0; [L712] 0 _Bool z$r_buff0_thd1; [L713] 0 _Bool z$r_buff0_thd2; [L714] 0 _Bool z$r_buff0_thd3; [L715] 0 _Bool z$r_buff1_thd0; [L716] 0 _Bool z$r_buff1_thd1; [L717] 0 _Bool z$r_buff1_thd2; [L718] 0 _Bool z$r_buff1_thd3; [L719] 0 _Bool z$read_delayed; [L720] 0 int *z$read_delayed_var; [L721] 0 int z$w_buff0; [L722] 0 _Bool z$w_buff0_used; [L723] 0 int z$w_buff1; [L724] 0 _Bool z$w_buff1_used; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1501; [L821] FCALL, FORK 0 pthread_create(&t1501, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 1 z$w_buff1 = z$w_buff0 [L731] 1 z$w_buff0 = 1 [L732] 1 z$w_buff1_used = z$w_buff0_used [L733] 1 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L735] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L736] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L737] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L738] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L739] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t1502; [L823] FCALL, FORK 0 pthread_create(&t1502, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L765] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L766] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L767] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L768] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L768] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L769] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L769] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L824] 0 pthread_t t1503; [L825] FCALL, FORK 0 pthread_create(&t1503, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 3 z$flush_delayed = weak$$choice2 [L785] 3 z$mem_tmp = z [L786] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L786] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L787] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L787] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L788] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L788] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L789] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L789] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L790] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L791] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L792] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] 3 __unbuffered_p2_EAX = z [L794] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L794] 3 z = z$flush_delayed ? z$mem_tmp : z [L795] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L801] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L801] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L802] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L745] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] EXPR 1 z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z [L745] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L747] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L747] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L748] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L749] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L749] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L772] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L774] 2 return 0; [L752] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L754] 1 return 0; [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L834] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L834] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L835] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L835] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L838] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 5.6s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 28 SDtfs, 11 SDslu, 26 SDs, 0 SdLazy, 212 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 125 ConstructedInterpolants, 0 QuantifiedInterpolants, 13701 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...