/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi003_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 06:27:24,516 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 06:27:24,518 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 06:27:24,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 06:27:24,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 06:27:24,544 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 06:27:24,545 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 06:27:24,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 06:27:24,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 06:27:24,548 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 06:27:24,549 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 06:27:24,550 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 06:27:24,551 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 06:27:24,551 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 06:27:24,552 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 06:27:24,553 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 06:27:24,554 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 06:27:24,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 06:27:24,556 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 06:27:24,557 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 06:27:24,559 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 06:27:24,560 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 06:27:24,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 06:27:24,561 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 06:27:24,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 06:27:24,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 06:27:24,563 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 06:27:24,564 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 06:27:24,564 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 06:27:24,565 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 06:27:24,565 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 06:27:24,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 06:27:24,566 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 06:27:24,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 06:27:24,568 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 06:27:24,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 06:27:24,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 06:27:24,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 06:27:24,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 06:27:24,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 06:27:24,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 06:27:24,571 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-RepeatedSemanticLbe.epf [2021-06-11 06:27:24,589 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 06:27:24,590 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 06:27:24,591 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 06:27:24,591 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 06:27:24,591 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 06:27:24,592 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 06:27:24,592 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 06:27:24,592 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 06:27:24,592 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 06:27:24,592 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 06:27:24,593 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 06:27:24,593 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 06:27:24,593 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 06:27:24,593 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 06:27:24,594 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 06:27:24,594 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 06:27:24,594 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 06:27:24,594 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 06:27:24,594 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 06:27:24,594 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 06:27:24,594 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 06:27:24,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 06:27:24,595 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 06:27:24,595 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 06:27:24,595 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 06:27:24,595 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 06:27:24,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 06:27:24,596 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 06:27:24,596 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 06:27:24,596 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-11 06:27:24,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 06:27:24,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 06:27:24,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 06:27:24,939 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 06:27:24,940 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 06:27:24,940 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_pso.opt.i [2021-06-11 06:27:25,025 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dd7cc728/42830778c1154774801fcca2eadb52c5/FLAG66569b870 [2021-06-11 06:27:25,542 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 06:27:25,542 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_pso.opt.i [2021-06-11 06:27:25,558 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dd7cc728/42830778c1154774801fcca2eadb52c5/FLAG66569b870 [2021-06-11 06:27:25,980 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dd7cc728/42830778c1154774801fcca2eadb52c5 [2021-06-11 06:27:25,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 06:27:25,983 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 06:27:25,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 06:27:25,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 06:27:25,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 06:27:25,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 06:27:25" (1/1) ... [2021-06-11 06:27:25,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6654184a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:27:25, skipping insertion in model container [2021-06-11 06:27:25,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 06:27:25" (1/1) ... [2021-06-11 06:27:26,002 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 06:27:26,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 06:27:26,197 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_pso.opt.i[991,1004] [2021-06-11 06:27:26,315 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 06:27:26,322 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 06:27:26,331 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_pso.opt.i[991,1004] [2021-06-11 06:27:26,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 06:27:26,424 INFO L208 MainTranslator]: Completed translation [2021-06-11 06:27:26,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:27:26 WrapperNode [2021-06-11 06:27:26,424 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 06:27:26,425 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 06:27:26,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 06:27:26,426 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 06:27:26,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:27:26" (1/1) ... [2021-06-11 06:27:26,446 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:27:26" (1/1) ... [2021-06-11 06:27:26,467 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 06:27:26,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 06:27:26,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 06:27:26,468 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 06:27:26,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:27:26" (1/1) ... [2021-06-11 06:27:26,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:27:26" (1/1) ... [2021-06-11 06:27:26,479 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:27:26" (1/1) ... [2021-06-11 06:27:26,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:27:26" (1/1) ... [2021-06-11 06:27:26,486 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:27:26" (1/1) ... [2021-06-11 06:27:26,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:27:26" (1/1) ... [2021-06-11 06:27:26,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:27:26" (1/1) ... [2021-06-11 06:27:26,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 06:27:26,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 06:27:26,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 06:27:26,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 06:27:26,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:27:26" (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 [2021-06-11 06:27:26,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 06:27:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 06:27:26,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 06:27:26,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 06:27:26,594 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 06:27:26,594 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 06:27:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 06:27:26,595 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 06:27:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 06:27:26,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 06:27:26,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 06:27:26,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 06:27:26,597 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 06:27:27,993 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 06:27:27,993 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 06:27:27,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 06:27:27 BoogieIcfgContainer [2021-06-11 06:27:27,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 06:27:27,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 06:27:27,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 06:27:28,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 06:27:28,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 06:27:25" (1/3) ... [2021-06-11 06:27:28,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f30e465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 06:27:28, skipping insertion in model container [2021-06-11 06:27:28,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:27:26" (2/3) ... [2021-06-11 06:27:28,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f30e465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 06:27:28, skipping insertion in model container [2021-06-11 06:27:28,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 06:27:27" (3/3) ... [2021-06-11 06:27:28,004 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi003_pso.opt.i [2021-06-11 06:27:28,010 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 06:27:28,014 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 06:27:28,014 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 06:27:28,044 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,044 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,044 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,044 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,044 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,044 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,044 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,045 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,045 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,045 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,045 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,045 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,045 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,045 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,045 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,045 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,046 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,046 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,046 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,046 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,046 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,046 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,046 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,046 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,046 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,046 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,047 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,059 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,059 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,059 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,059 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,059 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,060 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,060 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,061 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,064 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,064 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,065 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,071 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,071 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,071 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,071 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,071 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,071 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,071 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,071 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,073 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,074 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,074 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,076 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,077 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,077 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,077 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,077 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,078 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:27:28,081 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 06:27:28,096 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-11 06:27:28,129 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 06:27:28,129 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 06:27:28,129 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 06:27:28,129 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 06:27:28,129 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 06:27:28,129 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 06:27:28,130 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 06:27:28,130 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 06:27:28,144 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 83 transitions, 176 flow [2021-06-11 06:27:28,182 INFO L129 PetriNetUnfolder]: 2/81 cut-off events. [2021-06-11 06:27:28,182 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:27:28,195 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 2/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2021-06-11 06:27:28,196 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 83 transitions, 176 flow [2021-06-11 06:27:28,199 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 81 transitions, 168 flow [2021-06-11 06:27:28,200 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:27:28,211 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 81 transitions, 168 flow [2021-06-11 06:27:28,214 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 81 transitions, 168 flow [2021-06-11 06:27:28,215 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 81 transitions, 168 flow [2021-06-11 06:27:28,229 INFO L129 PetriNetUnfolder]: 2/81 cut-off events. [2021-06-11 06:27:28,229 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:27:28,230 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 81 events. 2/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2021-06-11 06:27:28,232 INFO L151 LiptonReduction]: Number of co-enabled transitions 968 [2021-06-11 06:27:28,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:28,329 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:27:28,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:28,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:27:28,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:27:28,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:28,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:28,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:28,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:28,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:28,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:28,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:28,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:28,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:28,719 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 06:27:28,719 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:27:28,742 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:28,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:28,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:28,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:28,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:28,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:28,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:28,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:28,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:28,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:28,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:28,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:29,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:29,013 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:27:29,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:29,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 06:27:29,023 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:27:29,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:29,031 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term [2021-06-11 06:27:29,031 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:27:29,034 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:29,038 INFO L147 QuantifierPusher]: treesize reduction 50, result has 50.0 percent of original size 50 [2021-06-11 06:27:29,040 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:27:29,047 INFO L142 QuantifierPusher]: treesize reduction 50, result has 68.8 percent of original size [2021-06-11 06:27:29,048 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 1] term [2021-06-11 06:27:29,049 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:27:29,051 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:29,056 INFO L147 QuantifierPusher]: treesize reduction 76, result has 39.7 percent of original size 50 [2021-06-11 06:27:29,061 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 3, 2, 1] term [2021-06-11 06:27:29,062 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:27:29,064 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:29,073 INFO L147 QuantifierPusher]: treesize reduction 141, result has 44.3 percent of original size 112 [2021-06-11 06:27:29,271 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-06-11 06:27:29,692 WARN L205 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-06-11 06:27:29,819 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-06-11 06:27:29,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:29,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:29,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:29,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:29,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:29,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:29,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:29,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:29,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:29,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:30,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:30,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:30,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:30,063 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:27:30,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:30,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:27:30,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:27:30,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:30,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:30,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:30,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:30,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:30,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:30,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:30,283 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:27:30,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:30,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:27:30,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-11 06:27:30,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:30,450 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:27:30,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:30,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:27:30,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:27:30,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:30,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:30,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:30,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:30,583 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 06:27:30,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:30,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:30,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:30,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:30,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:30,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:30,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:30,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:30,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:30,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:30,705 INFO L147 QuantifierPusher]: treesize reduction 29, result has 3.3 percent of original size 1 [2021-06-11 06:27:30,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:30,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:30,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:30,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:30,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:30,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:30,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:30,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:30,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:30,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:30,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:30,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:30,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:30,985 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:27:30,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:30,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:27:30,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:27:31,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:31,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:31,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:31,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:31,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:31,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:31,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:31,285 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:27:31,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:31,287 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:27:31,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:31,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 06:27:31,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 06:27:31,288 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:27:31,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:31,290 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:27:31,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:31,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-06-11 06:27:31,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-11 06:27:31,293 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:27:31,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:31,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-11 06:27:31,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-06-11 06:27:31,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:31,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:31,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:31,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:31,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:31,557 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:27:31,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:31,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:27:31,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:27:31,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:31,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:31,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:31,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:31,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:31,905 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 06:27:31,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:31,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:32,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:32,250 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:27:32,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:32,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:27:32,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:27:32,550 WARN L205 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-06-11 06:27:32,668 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-06-11 06:27:32,960 WARN L205 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-06-11 06:27:33,131 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-06-11 06:27:33,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:33,148 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:27:33,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:33,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:27:33,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:27:33,176 INFO L163 LiptonReduction]: Checked pairs total: 2627 [2021-06-11 06:27:33,177 INFO L165 LiptonReduction]: Total number of compositions: 76 [2021-06-11 06:27:33,182 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4983 [2021-06-11 06:27:33,196 INFO L129 PetriNetUnfolder]: 0/7 cut-off events. [2021-06-11 06:27:33,197 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:27:33,197 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:27:33,197 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-06-11 06:27:33,197 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:27:33,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:27:33,201 INFO L82 PathProgramCache]: Analyzing trace with hash 802172152, now seen corresponding path program 1 times [2021-06-11 06:27:33,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:27:33,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464064920] [2021-06-11 06:27:33,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:27:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:27:33,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:33,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:27:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:27:33,404 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464064920] [2021-06-11 06:27:33,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:27:33,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 06:27:33,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527316584] [2021-06-11 06:27:33,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 06:27:33,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:27:33,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 06:27:33,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 06:27:33,423 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 159 [2021-06-11 06:27:33,425 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:33,425 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:27:33,425 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 159 [2021-06-11 06:27:33,426 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:27:33,457 INFO L129 PetriNetUnfolder]: 9/48 cut-off events. [2021-06-11 06:27:33,457 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:27:33,457 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 48 events. 9/48 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 138 event pairs, 1 based on Foata normal form. 12/57 useless extension candidates. Maximal degree in co-relation 68. Up to 17 conditions per place. [2021-06-11 06:27:33,458 INFO L132 encePairwiseOnDemand]: 154/159 looper letters, 5 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2021-06-11 06:27:33,458 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 21 transitions, 62 flow [2021-06-11 06:27:33,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 06:27:33,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 06:27:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 399 transitions. [2021-06-11 06:27:33,469 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8364779874213837 [2021-06-11 06:27:33,470 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 399 transitions. [2021-06-11 06:27:33,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 399 transitions. [2021-06-11 06:27:33,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:27:33,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 399 transitions. [2021-06-11 06:27:33,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:33,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:33,487 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:33,489 INFO L185 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 3 states and 399 transitions. [2021-06-11 06:27:33,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 21 transitions, 62 flow [2021-06-11 06:27:33,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 21 transitions, 60 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 06:27:33,492 INFO L241 Difference]: Finished difference. Result has 26 places, 19 transitions, 46 flow [2021-06-11 06:27:33,493 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=26, PETRI_TRANSITIONS=19} [2021-06-11 06:27:33,494 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, -2 predicate places. [2021-06-11 06:27:33,494 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:27:33,494 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 19 transitions, 46 flow [2021-06-11 06:27:33,495 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 19 transitions, 46 flow [2021-06-11 06:27:33,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 19 transitions, 46 flow [2021-06-11 06:27:33,500 INFO L129 PetriNetUnfolder]: 0/19 cut-off events. [2021-06-11 06:27:33,501 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:27:33,501 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 19 events. 0/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 06:27:33,501 INFO L151 LiptonReduction]: Number of co-enabled transitions 156 [2021-06-11 06:27:33,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:33,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:33,718 INFO L163 LiptonReduction]: Checked pairs total: 370 [2021-06-11 06:27:33,718 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 06:27:33,718 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 224 [2021-06-11 06:27:33,720 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 44 flow [2021-06-11 06:27:33,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:33,720 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:27:33,720 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:27:33,721 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-11 06:27:33,721 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:27:33,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:27:33,728 INFO L82 PathProgramCache]: Analyzing trace with hash 314603772, now seen corresponding path program 1 times [2021-06-11 06:27:33,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:27:33,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238411940] [2021-06-11 06:27:33,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:27:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:27:33,829 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-06-11 06:27:33,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 06:27:33,839 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 06:27:33,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 06:27:33,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:27:33,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238411940] [2021-06-11 06:27:33,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:27:33,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 06:27:33,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414271921] [2021-06-11 06:27:33,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:27:33,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:27:33,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:27:33,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:27:33,847 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 161 [2021-06-11 06:27:33,848 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:33,848 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:27:33,848 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 161 [2021-06-11 06:27:33,848 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:27:33,930 INFO L129 PetriNetUnfolder]: 43/121 cut-off events. [2021-06-11 06:27:33,930 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:27:33,931 INFO L84 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 121 events. 43/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 520 event pairs, 4 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 216. Up to 33 conditions per place. [2021-06-11 06:27:33,931 INFO L132 encePairwiseOnDemand]: 153/161 looper letters, 5 selfloop transitions, 6 changer transitions 11/32 dead transitions. [2021-06-11 06:27:33,931 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 32 transitions, 116 flow [2021-06-11 06:27:33,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 06:27:33,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 06:27:33,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 578 transitions. [2021-06-11 06:27:33,936 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7180124223602484 [2021-06-11 06:27:33,936 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 578 transitions. [2021-06-11 06:27:33,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 578 transitions. [2021-06-11 06:27:33,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:27:33,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 578 transitions. [2021-06-11 06:27:33,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:33,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 161.0) internal successors, (966), 6 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:33,941 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 161.0) internal successors, (966), 6 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:33,941 INFO L185 Difference]: Start difference. First operand has 25 places, 18 transitions, 44 flow. Second operand 5 states and 578 transitions. [2021-06-11 06:27:33,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 32 transitions, 116 flow [2021-06-11 06:27:33,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 32 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 06:27:33,942 INFO L241 Difference]: Finished difference. Result has 31 places, 21 transitions, 88 flow [2021-06-11 06:27:33,942 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2021-06-11 06:27:33,943 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, 3 predicate places. [2021-06-11 06:27:33,943 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:27:33,943 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 21 transitions, 88 flow [2021-06-11 06:27:33,944 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 88 flow [2021-06-11 06:27:33,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 28 places, 21 transitions, 88 flow [2021-06-11 06:27:33,964 INFO L129 PetriNetUnfolder]: 18/72 cut-off events. [2021-06-11 06:27:33,964 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-06-11 06:27:33,965 INFO L84 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 72 events. 18/72 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 260 event pairs, 4 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 162. Up to 27 conditions per place. [2021-06-11 06:27:33,966 INFO L151 LiptonReduction]: Number of co-enabled transitions 130 [2021-06-11 06:27:34,043 INFO L163 LiptonReduction]: Checked pairs total: 69 [2021-06-11 06:27:34,044 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:27:34,044 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 101 [2021-06-11 06:27:34,044 INFO L480 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 88 flow [2021-06-11 06:27:34,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:34,045 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:27:34,045 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:27:34,045 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-11 06:27:34,045 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:27:34,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:27:34,045 INFO L82 PathProgramCache]: Analyzing trace with hash 314604162, now seen corresponding path program 1 times [2021-06-11 06:27:34,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:27:34,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284365285] [2021-06-11 06:27:34,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:27:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:27:34,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:34,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:27:34,095 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-06-11 06:27:34,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 06:27:34,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:27:34,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284365285] [2021-06-11 06:27:34,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:27:34,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 06:27:34,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615868996] [2021-06-11 06:27:34,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:27:34,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:27:34,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:27:34,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:27:34,111 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 161 [2021-06-11 06:27:34,111 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:34,112 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:27:34,112 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 161 [2021-06-11 06:27:34,112 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:27:34,139 INFO L129 PetriNetUnfolder]: 10/55 cut-off events. [2021-06-11 06:27:34,140 INFO L130 PetriNetUnfolder]: For 26/36 co-relation queries the response was YES. [2021-06-11 06:27:34,140 INFO L84 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 55 events. 10/55 cut-off events. For 26/36 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 155 event pairs, 0 based on Foata normal form. 3/56 useless extension candidates. Maximal degree in co-relation 150. Up to 19 conditions per place. [2021-06-11 06:27:34,140 INFO L132 encePairwiseOnDemand]: 155/161 looper letters, 6 selfloop transitions, 6 changer transitions 2/24 dead transitions. [2021-06-11 06:27:34,140 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 24 transitions, 134 flow [2021-06-11 06:27:34,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 06:27:34,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 06:27:34,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2021-06-11 06:27:34,142 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7639751552795031 [2021-06-11 06:27:34,142 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 492 transitions. [2021-06-11 06:27:34,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 492 transitions. [2021-06-11 06:27:34,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:27:34,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 492 transitions. [2021-06-11 06:27:34,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:34,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 161.0) internal successors, (805), 5 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:34,146 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 161.0) internal successors, (805), 5 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:34,146 INFO L185 Difference]: Start difference. First operand has 28 places, 21 transitions, 88 flow. Second operand 4 states and 492 transitions. [2021-06-11 06:27:34,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 24 transitions, 134 flow [2021-06-11 06:27:34,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 24 transitions, 108 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-06-11 06:27:34,149 INFO L241 Difference]: Finished difference. Result has 29 places, 22 transitions, 96 flow [2021-06-11 06:27:34,149 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=29, PETRI_TRANSITIONS=22} [2021-06-11 06:27:34,149 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, 1 predicate places. [2021-06-11 06:27:34,149 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:27:34,149 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 22 transitions, 96 flow [2021-06-11 06:27:34,150 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 22 transitions, 96 flow [2021-06-11 06:27:34,150 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 96 flow [2021-06-11 06:27:34,158 INFO L129 PetriNetUnfolder]: 9/54 cut-off events. [2021-06-11 06:27:34,158 INFO L130 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2021-06-11 06:27:34,158 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 54 events. 9/54 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 169 event pairs, 2 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 116. Up to 18 conditions per place. [2021-06-11 06:27:34,160 INFO L151 LiptonReduction]: Number of co-enabled transitions 134 [2021-06-11 06:27:34,162 INFO L163 LiptonReduction]: Checked pairs total: 70 [2021-06-11 06:27:34,162 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:27:34,162 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13 [2021-06-11 06:27:34,166 INFO L480 AbstractCegarLoop]: Abstraction has has 29 places, 22 transitions, 96 flow [2021-06-11 06:27:34,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:34,166 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:27:34,166 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:27:34,166 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 06:27:34,167 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:27:34,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:27:34,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1305563887, now seen corresponding path program 1 times [2021-06-11 06:27:34,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:27:34,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881061760] [2021-06-11 06:27:34,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:27:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:27:34,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:34,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:27:34,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:27:34,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881061760] [2021-06-11 06:27:34,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:27:34,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 06:27:34,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326553708] [2021-06-11 06:27:34,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 06:27:34,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:27:34,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 06:27:34,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 06:27:34,209 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 161 [2021-06-11 06:27:34,210 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:34,210 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:27:34,210 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 161 [2021-06-11 06:27:34,210 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:27:34,219 INFO L129 PetriNetUnfolder]: 7/44 cut-off events. [2021-06-11 06:27:34,219 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-06-11 06:27:34,219 INFO L84 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 44 events. 7/44 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 120 event pairs, 0 based on Foata normal form. 2/44 useless extension candidates. Maximal degree in co-relation 101. Up to 14 conditions per place. [2021-06-11 06:27:34,220 INFO L132 encePairwiseOnDemand]: 158/161 looper letters, 1 selfloop transitions, 3 changer transitions 0/22 dead transitions. [2021-06-11 06:27:34,220 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 22 transitions, 104 flow [2021-06-11 06:27:34,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 06:27:34,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 06:27:34,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2021-06-11 06:27:34,226 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8467908902691511 [2021-06-11 06:27:34,226 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 409 transitions. [2021-06-11 06:27:34,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions. [2021-06-11 06:27:34,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:27:34,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions. [2021-06-11 06:27:34,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:34,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:34,229 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:34,229 INFO L185 Difference]: Start difference. First operand has 29 places, 22 transitions, 96 flow. Second operand 3 states and 409 transitions. [2021-06-11 06:27:34,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 22 transitions, 104 flow [2021-06-11 06:27:34,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 22 transitions, 101 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 06:27:34,231 INFO L241 Difference]: Finished difference. Result has 31 places, 22 transitions, 104 flow [2021-06-11 06:27:34,231 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2021-06-11 06:27:34,231 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, 3 predicate places. [2021-06-11 06:27:34,231 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:27:34,231 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 22 transitions, 104 flow [2021-06-11 06:27:34,232 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 22 transitions, 104 flow [2021-06-11 06:27:34,232 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 22 transitions, 104 flow [2021-06-11 06:27:34,237 INFO L129 PetriNetUnfolder]: 7/44 cut-off events. [2021-06-11 06:27:34,237 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-06-11 06:27:34,238 INFO L84 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 44 events. 7/44 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 133 event pairs, 1 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 106. Up to 14 conditions per place. [2021-06-11 06:27:34,238 INFO L151 LiptonReduction]: Number of co-enabled transitions 134 [2021-06-11 06:27:34,241 INFO L163 LiptonReduction]: Checked pairs total: 70 [2021-06-11 06:27:34,241 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:27:34,241 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-06-11 06:27:34,242 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 104 flow [2021-06-11 06:27:34,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:34,242 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:27:34,242 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:27:34,242 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 06:27:34,243 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:27:34,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:27:34,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1849021894, now seen corresponding path program 1 times [2021-06-11 06:27:34,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:27:34,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789753928] [2021-06-11 06:27:34,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:27:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:27:34,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:34,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:27:34,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:34,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:27:34,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:34,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:34,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:27:34,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789753928] [2021-06-11 06:27:34,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:27:34,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 06:27:34,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146248274] [2021-06-11 06:27:34,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:27:34,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:27:34,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:27:34,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:27:34,317 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 161 [2021-06-11 06:27:34,318 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:34,318 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:27:34,318 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 161 [2021-06-11 06:27:34,318 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:27:34,360 INFO L129 PetriNetUnfolder]: 30/105 cut-off events. [2021-06-11 06:27:34,360 INFO L130 PetriNetUnfolder]: For 16/17 co-relation queries the response was YES. [2021-06-11 06:27:34,361 INFO L84 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 105 events. 30/105 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 445 event pairs, 4 based on Foata normal form. 11/96 useless extension candidates. Maximal degree in co-relation 240. Up to 38 conditions per place. [2021-06-11 06:27:34,362 INFO L132 encePairwiseOnDemand]: 155/161 looper letters, 4 selfloop transitions, 7 changer transitions 3/30 dead transitions. [2021-06-11 06:27:34,362 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 148 flow [2021-06-11 06:27:34,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 06:27:34,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 06:27:34,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 646 transitions. [2021-06-11 06:27:34,364 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8024844720496894 [2021-06-11 06:27:34,364 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 646 transitions. [2021-06-11 06:27:34,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 646 transitions. [2021-06-11 06:27:34,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:27:34,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 646 transitions. [2021-06-11 06:27:34,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:34,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 161.0) internal successors, (966), 6 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:34,369 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 161.0) internal successors, (966), 6 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:34,369 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 104 flow. Second operand 5 states and 646 transitions. [2021-06-11 06:27:34,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 148 flow [2021-06-11 06:27:34,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 30 transitions, 137 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-11 06:27:34,372 INFO L241 Difference]: Finished difference. Result has 35 places, 27 transitions, 139 flow [2021-06-11 06:27:34,372 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2021-06-11 06:27:34,372 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, 7 predicate places. [2021-06-11 06:27:34,372 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:27:34,372 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 27 transitions, 139 flow [2021-06-11 06:27:34,373 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 27 transitions, 139 flow [2021-06-11 06:27:34,373 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 27 transitions, 139 flow [2021-06-11 06:27:34,382 INFO L129 PetriNetUnfolder]: 16/85 cut-off events. [2021-06-11 06:27:34,382 INFO L130 PetriNetUnfolder]: For 41/48 co-relation queries the response was YES. [2021-06-11 06:27:34,382 INFO L84 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 85 events. 16/85 cut-off events. For 41/48 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 368 event pairs, 4 based on Foata normal form. 4/84 useless extension candidates. Maximal degree in co-relation 219. Up to 27 conditions per place. [2021-06-11 06:27:34,383 INFO L151 LiptonReduction]: Number of co-enabled transitions 168 [2021-06-11 06:27:34,385 INFO L163 LiptonReduction]: Checked pairs total: 46 [2021-06-11 06:27:34,385 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:27:34,385 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13 [2021-06-11 06:27:34,387 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 139 flow [2021-06-11 06:27:34,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:34,387 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:27:34,387 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:27:34,387 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-11 06:27:34,387 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:27:34,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:27:34,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1562636264, now seen corresponding path program 1 times [2021-06-11 06:27:34,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:27:34,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400584738] [2021-06-11 06:27:34,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:27:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:27:34,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:34,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:34,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:34,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:27:34,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:34,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:27:34,490 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-06-11 06:27:34,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 06:27:34,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:27:34,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400584738] [2021-06-11 06:27:34,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:27:34,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 06:27:34,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738211917] [2021-06-11 06:27:34,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 06:27:34,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:27:34,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 06:27:34,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 06:27:34,501 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 161 [2021-06-11 06:27:34,502 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:34,502 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:27:34,502 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 161 [2021-06-11 06:27:34,502 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:27:34,573 INFO L129 PetriNetUnfolder]: 27/144 cut-off events. [2021-06-11 06:27:34,574 INFO L130 PetriNetUnfolder]: For 103/139 co-relation queries the response was YES. [2021-06-11 06:27:34,574 INFO L84 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 144 events. 27/144 cut-off events. For 103/139 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 813 event pairs, 5 based on Foata normal form. 15/151 useless extension candidates. Maximal degree in co-relation 413. Up to 53 conditions per place. [2021-06-11 06:27:34,575 INFO L132 encePairwiseOnDemand]: 154/161 looper letters, 5 selfloop transitions, 6 changer transitions 9/32 dead transitions. [2021-06-11 06:27:34,575 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 32 transitions, 206 flow [2021-06-11 06:27:34,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 06:27:34,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 06:27:34,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 737 transitions. [2021-06-11 06:27:34,577 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7629399585921325 [2021-06-11 06:27:34,577 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 737 transitions. [2021-06-11 06:27:34,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 737 transitions. [2021-06-11 06:27:34,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:27:34,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 737 transitions. [2021-06-11 06:27:34,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:34,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 161.0) internal successors, (1127), 7 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:34,622 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 161.0) internal successors, (1127), 7 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:34,622 INFO L185 Difference]: Start difference. First operand has 35 places, 27 transitions, 139 flow. Second operand 6 states and 737 transitions. [2021-06-11 06:27:34,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 32 transitions, 206 flow [2021-06-11 06:27:34,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 32 transitions, 206 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 06:27:34,624 INFO L241 Difference]: Finished difference. Result has 43 places, 23 transitions, 134 flow [2021-06-11 06:27:34,625 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=134, PETRI_PLACES=43, PETRI_TRANSITIONS=23} [2021-06-11 06:27:34,625 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, 15 predicate places. [2021-06-11 06:27:34,625 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:27:34,625 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 23 transitions, 134 flow [2021-06-11 06:27:34,625 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 23 transitions, 134 flow [2021-06-11 06:27:34,625 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 23 transitions, 134 flow [2021-06-11 06:27:34,638 INFO L129 PetriNetUnfolder]: 9/87 cut-off events. [2021-06-11 06:27:34,638 INFO L130 PetriNetUnfolder]: For 79/83 co-relation queries the response was YES. [2021-06-11 06:27:34,638 INFO L84 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 87 events. 9/87 cut-off events. For 79/83 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 413 event pairs, 3 based on Foata normal form. 1/86 useless extension candidates. Maximal degree in co-relation 238. Up to 28 conditions per place. [2021-06-11 06:27:34,639 INFO L151 LiptonReduction]: Number of co-enabled transitions 104 [2021-06-11 06:27:34,640 INFO L163 LiptonReduction]: Checked pairs total: 30 [2021-06-11 06:27:34,640 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:27:34,641 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16 [2021-06-11 06:27:34,641 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 23 transitions, 134 flow [2021-06-11 06:27:34,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:34,642 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:27:34,642 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:27:34,642 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 06:27:34,642 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:27:34,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:27:34,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1042351851, now seen corresponding path program 1 times [2021-06-11 06:27:34,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:27:34,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163883938] [2021-06-11 06:27:34,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:27:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:27:34,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:34,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:27:34,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:34,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:27:34,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:34,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:27:34,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:27:34,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:27:34,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:27:34,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163883938] [2021-06-11 06:27:34,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:27:34,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 06:27:34,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433831360] [2021-06-11 06:27:34,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 06:27:34,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:27:34,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 06:27:34,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 06:27:34,728 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 161 [2021-06-11 06:27:34,729 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 23 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:34,729 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:27:34,729 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 161 [2021-06-11 06:27:34,729 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:27:34,778 INFO L129 PetriNetUnfolder]: 10/80 cut-off events. [2021-06-11 06:27:34,779 INFO L130 PetriNetUnfolder]: For 94/99 co-relation queries the response was YES. [2021-06-11 06:27:34,779 INFO L84 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 80 events. 10/80 cut-off events. For 94/99 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 334 event pairs, 0 based on Foata normal form. 15/94 useless extension candidates. Maximal degree in co-relation 261. Up to 31 conditions per place. [2021-06-11 06:27:34,779 INFO L132 encePairwiseOnDemand]: 155/161 looper letters, 2 selfloop transitions, 5 changer transitions 5/27 dead transitions. [2021-06-11 06:27:34,779 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 27 transitions, 177 flow [2021-06-11 06:27:34,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 06:27:34,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 06:27:34,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 770 transitions. [2021-06-11 06:27:34,782 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7971014492753623 [2021-06-11 06:27:34,782 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 770 transitions. [2021-06-11 06:27:34,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 770 transitions. [2021-06-11 06:27:34,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:27:34,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 770 transitions. [2021-06-11 06:27:34,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:34,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 161.0) internal successors, (1127), 7 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:34,786 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 161.0) internal successors, (1127), 7 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:34,786 INFO L185 Difference]: Start difference. First operand has 40 places, 23 transitions, 134 flow. Second operand 6 states and 770 transitions. [2021-06-11 06:27:34,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 27 transitions, 177 flow [2021-06-11 06:27:34,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 27 transitions, 149 flow, removed 8 selfloop flow, removed 6 redundant places. [2021-06-11 06:27:34,788 INFO L241 Difference]: Finished difference. Result has 42 places, 22 transitions, 125 flow [2021-06-11 06:27:34,788 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=125, PETRI_PLACES=42, PETRI_TRANSITIONS=22} [2021-06-11 06:27:34,789 INFO L343 CegarLoopForPetriNet]: 28 programPoint places, 14 predicate places. [2021-06-11 06:27:34,789 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:27:34,789 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 22 transitions, 125 flow [2021-06-11 06:27:34,789 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 22 transitions, 125 flow [2021-06-11 06:27:34,789 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 22 transitions, 125 flow [2021-06-11 06:27:34,798 INFO L129 PetriNetUnfolder]: 4/50 cut-off events. [2021-06-11 06:27:34,798 INFO L130 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2021-06-11 06:27:34,798 INFO L84 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 50 events. 4/50 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 148. Up to 16 conditions per place. [2021-06-11 06:27:34,798 INFO L151 LiptonReduction]: Number of co-enabled transitions 38 [2021-06-11 06:27:34,800 INFO L163 LiptonReduction]: Checked pairs total: 14 [2021-06-11 06:27:34,800 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:27:34,800 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11 [2021-06-11 06:27:34,801 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 22 transitions, 125 flow [2021-06-11 06:27:34,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:27:34,801 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:27:34,801 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:27:34,801 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 06:27:34,801 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:27:34,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:27:34,802 INFO L82 PathProgramCache]: Analyzing trace with hash -546373783, now seen corresponding path program 1 times [2021-06-11 06:27:34,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:27:34,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500632986] [2021-06-11 06:27:34,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:27:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 06:27:34,829 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 06:27:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 06:27:34,860 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 06:27:34,883 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 06:27:34,884 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 06:27:34,884 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-11 06:27:34,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 06:27:34 BasicIcfg [2021-06-11 06:27:34,936 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 06:27:34,937 INFO L168 Benchmark]: Toolchain (without parser) took 8953.56 ms. Allocated memory was 350.2 MB in the beginning and 606.1 MB in the end (delta: 255.9 MB). Free memory was 312.5 MB in the beginning and 508.0 MB in the end (delta: -195.5 MB). Peak memory consumption was 64.0 MB. Max. memory is 16.0 GB. [2021-06-11 06:27:34,937 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 350.2 MB. Free memory is still 330.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 06:27:34,937 INFO L168 Benchmark]: CACSL2BoogieTranslator took 433.57 ms. Allocated memory is still 350.2 MB. Free memory was 312.3 MB in the beginning and 309.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 9.5 MB. Max. memory is 16.0 GB. [2021-06-11 06:27:34,938 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.75 ms. Allocated memory is still 350.2 MB. Free memory was 309.7 MB in the beginning and 307.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 06:27:34,938 INFO L168 Benchmark]: Boogie Preprocessor took 26.98 ms. Allocated memory is still 350.2 MB. Free memory was 307.6 MB in the beginning and 305.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 06:27:34,938 INFO L168 Benchmark]: RCFGBuilder took 1500.88 ms. Allocated memory is still 350.2 MB. Free memory was 305.5 MB in the beginning and 263.3 MB in the end (delta: 42.2 MB). Peak memory consumption was 113.5 MB. Max. memory is 16.0 GB. [2021-06-11 06:27:34,938 INFO L168 Benchmark]: TraceAbstraction took 6937.28 ms. Allocated memory was 350.2 MB in the beginning and 606.1 MB in the end (delta: 255.9 MB). Free memory was 262.3 MB in the beginning and 508.0 MB in the end (delta: -245.7 MB). Peak memory consumption was 10.2 MB. Max. memory is 16.0 GB. [2021-06-11 06:27:34,939 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 350.2 MB. Free memory is still 330.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 433.57 ms. Allocated memory is still 350.2 MB. Free memory was 312.3 MB in the beginning and 309.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 9.5 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 41.75 ms. Allocated memory is still 350.2 MB. Free memory was 309.7 MB in the beginning and 307.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 26.98 ms. Allocated memory is still 350.2 MB. Free memory was 307.6 MB in the beginning and 305.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1500.88 ms. Allocated memory is still 350.2 MB. Free memory was 305.5 MB in the beginning and 263.3 MB in the end (delta: 42.2 MB). Peak memory consumption was 113.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 6937.28 ms. Allocated memory was 350.2 MB in the beginning and 606.1 MB in the end (delta: 255.9 MB). Free memory was 262.3 MB in the beginning and 508.0 MB in the end (delta: -245.7 MB). Peak memory consumption was 10.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4962.9ms, 86 PlacesBefore, 28 PlacesAfterwards, 81 TransitionsBefore, 22 TransitionsAfterwards, 968 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 2627 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1351, positive: 1232, positive conditional: 0, positive unconditional: 1232, negative: 119, negative conditional: 0, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 743, positive: 711, positive conditional: 0, positive unconditional: 711, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 743, positive: 711, positive conditional: 0, positive unconditional: 711, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 743, positive: 697, positive conditional: 0, positive unconditional: 697, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 46, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 366, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 340, negative conditional: 0, negative unconditional: 340, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1351, positive: 521, positive conditional: 0, positive unconditional: 521, negative: 87, negative conditional: 0, negative unconditional: 87, unknown: 743, unknown conditional: 0, unknown unconditional: 743] , Statistics on independence cache: Total cache size (in pairs): 1284, Positive cache size: 1252, Positive conditional cache size: 0, Positive unconditional cache size: 1252, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 222.7ms, 26 PlacesBefore, 25 PlacesAfterwards, 19 TransitionsBefore, 18 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 370 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 138, positive: 102, positive conditional: 0, positive unconditional: 102, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 69, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 138, positive: 84, positive conditional: 0, positive unconditional: 84, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 26, unknown conditional: 0, unknown unconditional: 26] , Statistics on independence cache: Total cache size (in pairs): 1338, Positive cache size: 1298, Positive conditional cache size: 0, Positive unconditional cache size: 1298, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 100.1ms, 31 PlacesBefore, 28 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 130 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 69 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 75, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 75, negative conditional: 0, negative unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1340, Positive cache size: 1298, Positive conditional cache size: 0, Positive unconditional cache size: 1298, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.3ms, 29 PlacesBefore, 29 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 70 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1340, Positive cache size: 1298, Positive conditional cache size: 0, Positive unconditional cache size: 1298, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.4ms, 31 PlacesBefore, 31 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 70 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1340, Positive cache size: 1298, Positive conditional cache size: 0, Positive unconditional cache size: 1298, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.6ms, 35 PlacesBefore, 35 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 46 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1340, Positive cache size: 1298, Positive conditional cache size: 0, Positive unconditional cache size: 1298, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.2ms, 43 PlacesBefore, 40 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 30 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1340, Positive cache size: 1298, Positive conditional cache size: 0, Positive unconditional cache size: 1298, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.0ms, 42 PlacesBefore, 38 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 14 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1340, Positive cache size: 1298, Positive conditional cache size: 0, Positive unconditional cache size: 1298, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1639; [L814] FCALL, FORK 0 pthread_create(&t1639, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L815] 0 pthread_t t1640; [L816] FCALL, FORK 0 pthread_create(&t1640, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L782] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L751] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L752] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L753] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L754] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L755] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L756] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = x [L758] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L4] COND FALSE 0 !(!cond) [L822] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L822] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L822] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L822] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L824] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L826] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 82 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 6760.6ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 477.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5064.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 33 SDtfs, 22 SDslu, 17 SDs, 0 SdLazy, 86 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 114.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 98.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=5, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 22.1ms SsaConstructionTime, 245.0ms SatisfiabilityAnalysisTime, 349.3ms InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 337 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...