/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/podwr001_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:40:12,417 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:40:12,419 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:40:12,456 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:40:12,456 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:40:12,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:40:12,458 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:40:12,464 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:40:12,465 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:40:12,465 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:40:12,466 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:40:12,467 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:40:12,467 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:40:12,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:40:12,468 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:40:12,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:40:12,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:40:12,470 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:40:12,471 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:40:12,472 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:40:12,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:40:12,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:40:12,476 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:40:12,477 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:40:12,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:40:12,479 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:40:12,479 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:40:12,479 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:40:12,480 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:40:12,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:40:12,481 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:40:12,481 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:40:12,482 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:40:12,482 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:40:12,483 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:40:12,483 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:40:12,484 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:40:12,484 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:40:12,484 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:40:12,485 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:40:12,485 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:40:12,494 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-03-25 14:40:12,519 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:40:12,520 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:40:12,520 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:40:12,520 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:40:12,520 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:40:12,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:40:12,521 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:40:12,521 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:40:12,521 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:40:12,521 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:40:12,521 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:40:12,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:40:12,521 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:40:12,521 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:40:12,521 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:40:12,521 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:40:12,522 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:40:12,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:40:12,522 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:40:12,522 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:40:12,522 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:40:12,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:40:12,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:40:12,522 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:40:12,522 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:40:12,522 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:40:12,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:40:12,523 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:40:12,523 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:40:12,523 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-03-25 14:40:12,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:40:12,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:40:12,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:40:12,828 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:40:12,829 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:40:12,829 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr001_tso.oepc.i [2021-03-25 14:40:12,891 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f4f68b30/23e6f6e024a84918814146094f755bc3/FLAG1802bf84e [2021-03-25 14:40:13,253 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:40:13,253 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr001_tso.oepc.i [2021-03-25 14:40:13,263 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f4f68b30/23e6f6e024a84918814146094f755bc3/FLAG1802bf84e [2021-03-25 14:40:13,631 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f4f68b30/23e6f6e024a84918814146094f755bc3 [2021-03-25 14:40:13,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:40:13,634 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:40:13,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:40:13,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:40:13,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:40:13,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:40:13" (1/1) ... [2021-03-25 14:40:13,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dd5faaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:13, skipping insertion in model container [2021-03-25 14:40:13,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:40:13" (1/1) ... [2021-03-25 14:40:13,645 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:40:13,677 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:40:13,777 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/podwr001_tso.oepc.i[951,964] [2021-03-25 14:40:13,904 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:40:13,914 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:40:13,924 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/podwr001_tso.oepc.i[951,964] [2021-03-25 14:40:13,990 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:40:14,053 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:40:14,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:14 WrapperNode [2021-03-25 14:40:14,054 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:40:14,055 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:40:14,055 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:40:14,055 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:40:14,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:14" (1/1) ... [2021-03-25 14:40:14,087 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:14" (1/1) ... [2021-03-25 14:40:14,110 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:40:14,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:40:14,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:40:14,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:40:14,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:14" (1/1) ... [2021-03-25 14:40:14,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:14" (1/1) ... [2021-03-25 14:40:14,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:14" (1/1) ... [2021-03-25 14:40:14,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:14" (1/1) ... [2021-03-25 14:40:14,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:14" (1/1) ... [2021-03-25 14:40:14,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:14" (1/1) ... [2021-03-25 14:40:14,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:14" (1/1) ... [2021-03-25 14:40:14,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:40:14,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:40:14,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:40:14,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:40:14,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:14" (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-03-25 14:40:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:40:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:40:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:40:14,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:40:14,212 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:40:14,212 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:40:14,212 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:40:14,213 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:40:14,213 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:40:14,213 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:40:14,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:40:14,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:40:14,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:40:14,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:40:14,215 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 14:40:15,609 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:40:15,609 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:40:15,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:40:15 BoogieIcfgContainer [2021-03-25 14:40:15,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:40:15,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:40:15,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:40:15,614 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:40:15,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:40:13" (1/3) ... [2021-03-25 14:40:15,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc26e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:40:15, skipping insertion in model container [2021-03-25 14:40:15,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:40:14" (2/3) ... [2021-03-25 14:40:15,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cc26e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:40:15, skipping insertion in model container [2021-03-25 14:40:15,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:40:15" (3/3) ... [2021-03-25 14:40:15,617 INFO L111 eAbstractionObserver]: Analyzing ICFG podwr001_tso.oepc.i [2021-03-25 14:40:15,623 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:40:15,627 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:40:15,628 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:40:15,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,655 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,655 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,655 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,655 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,656 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,656 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,656 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,656 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,658 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,659 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,659 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,659 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,659 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,662 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,662 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,662 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,662 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,664 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,664 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,664 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,664 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,664 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,664 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,664 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,664 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,664 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,664 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,664 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,664 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,664 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,665 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,665 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,665 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,665 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,667 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,670 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,670 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,670 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,671 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,671 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,671 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,671 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,671 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,671 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,671 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,671 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,671 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,671 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,671 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,672 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,672 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,672 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,672 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,673 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,674 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,676 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,676 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,676 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,676 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,676 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,676 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,676 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,676 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,677 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,677 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,680 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,680 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,680 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,681 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:40:15,681 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:40:15,694 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 14:40:15,707 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:40:15,707 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:40:15,707 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:40:15,707 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:40:15,707 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:40:15,707 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:40:15,708 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:40:15,708 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:40:15,714 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 213 flow [2021-03-25 14:40:15,738 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2021-03-25 14:40:15,738 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:40:15,741 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-25 14:40:15,742 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 99 transitions, 213 flow [2021-03-25 14:40:15,745 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 96 transitions, 201 flow [2021-03-25 14:40:15,746 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:40:15,754 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 96 transitions, 201 flow [2021-03-25 14:40:15,756 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 96 transitions, 201 flow [2021-03-25 14:40:15,757 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 201 flow [2021-03-25 14:40:15,769 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2021-03-25 14:40:15,769 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:40:15,770 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-25 14:40:15,772 INFO L142 LiptonReduction]: Number of co-enabled transitions 1694 [2021-03-25 14:40:16,776 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:40:17,090 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:40:18,001 INFO L154 LiptonReduction]: Checked pairs total: 3077 [2021-03-25 14:40:18,002 INFO L156 LiptonReduction]: Total number of compositions: 68 [2021-03-25 14:40:18,003 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2258 [2021-03-25 14:40:18,023 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-03-25 14:40:18,023 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:40:18,023 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:40:18,024 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:40:18,024 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:40:18,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:40:18,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1843485172, now seen corresponding path program 1 times [2021-03-25 14:40:18,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:40:18,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070305762] [2021-03-25 14:40:18,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:40:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:40:18,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:18,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:40:18,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:18,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:40:18,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:40:18,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070305762] [2021-03-25 14:40:18,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:40:18,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:40:18,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217647519] [2021-03-25 14:40:18,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:40:18,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:40:18,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:40:18,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:40:18,325 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 167 [2021-03-25 14:40:18,328 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 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-03-25 14:40:18,329 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:40:18,329 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 167 [2021-03-25 14:40:18,329 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:40:18,409 INFO L129 PetriNetUnfolder]: 49/140 cut-off events. [2021-03-25 14:40:18,409 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:40:18,410 INFO L84 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 140 events. 49/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 589 event pairs, 9 based on Foata normal form. 16/149 useless extension candidates. Maximal degree in co-relation 216. Up to 65 conditions per place. [2021-03-25 14:40:18,412 INFO L132 encePairwiseOnDemand]: 163/167 looper letters, 9 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2021-03-25 14:40:18,412 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 109 flow [2021-03-25 14:40:18,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:40:18,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:40:18,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2021-03-25 14:40:18,427 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8962075848303394 [2021-03-25 14:40:18,427 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2021-03-25 14:40:18,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2021-03-25 14:40:18,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:40:18,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2021-03-25 14:40:18,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 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-03-25 14:40:18,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 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-03-25 14:40:18,444 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 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-03-25 14:40:18,445 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 449 transitions. [2021-03-25 14:40:18,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 109 flow [2021-03-25 14:40:18,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 106 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 14:40:18,449 INFO L241 Difference]: Finished difference. Result has 44 places, 35 transitions, 80 flow [2021-03-25 14:40:18,450 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2021-03-25 14:40:18,450 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2021-03-25 14:40:18,450 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:40:18,451 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 35 transitions, 80 flow [2021-03-25 14:40:18,451 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 80 flow [2021-03-25 14:40:18,452 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 80 flow [2021-03-25 14:40:18,458 INFO L129 PetriNetUnfolder]: 0/35 cut-off events. [2021-03-25 14:40:18,459 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:40:18,459 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 40 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:40:18,460 INFO L142 LiptonReduction]: Number of co-enabled transitions 312 [2021-03-25 14:40:19,389 INFO L154 LiptonReduction]: Checked pairs total: 1272 [2021-03-25 14:40:19,389 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-25 14:40:19,390 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 940 [2021-03-25 14:40:19,390 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 60 flow [2021-03-25 14:40:19,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 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-03-25 14:40:19,391 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:40:19,391 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:40:19,391 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:40:19,391 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:40:19,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:40:19,391 INFO L82 PathProgramCache]: Analyzing trace with hash 394595438, now seen corresponding path program 1 times [2021-03-25 14:40:19,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:40:19,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313757459] [2021-03-25 14:40:19,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:40:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:40:19,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:19,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:40:19,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:19,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:40:19,487 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:40:19,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:40:19,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:19,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:40:19,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:40:19,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313757459] [2021-03-25 14:40:19,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:40:19,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:40:19,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485296002] [2021-03-25 14:40:19,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:40:19,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:40:19,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:40:19,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:40:19,495 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 178 [2021-03-25 14:40:19,495 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 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-03-25 14:40:19,495 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:40:19,496 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 178 [2021-03-25 14:40:19,496 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:40:19,549 INFO L129 PetriNetUnfolder]: 40/108 cut-off events. [2021-03-25 14:40:19,550 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:40:19,550 INFO L84 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 108 events. 40/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 431 event pairs, 17 based on Foata normal form. 8/99 useless extension candidates. Maximal degree in co-relation 186. Up to 64 conditions per place. [2021-03-25 14:40:19,551 INFO L132 encePairwiseOnDemand]: 172/178 looper letters, 5 selfloop transitions, 4 changer transitions 9/36 dead transitions. [2021-03-25 14:40:19,551 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 36 transitions, 118 flow [2021-03-25 14:40:19,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:40:19,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:40:19,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 745 transitions. [2021-03-25 14:40:19,555 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8370786516853933 [2021-03-25 14:40:19,555 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 745 transitions. [2021-03-25 14:40:19,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 745 transitions. [2021-03-25 14:40:19,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:40:19,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 745 transitions. [2021-03-25 14:40:19,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.0) internal successors, (745), 5 states have internal predecessors, (745), 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-03-25 14:40:19,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 178.0) internal successors, (1068), 6 states have internal predecessors, (1068), 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-03-25 14:40:19,560 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 178.0) internal successors, (1068), 6 states have internal predecessors, (1068), 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-03-25 14:40:19,560 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 60 flow. Second operand 5 states and 745 transitions. [2021-03-25 14:40:19,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 36 transitions, 118 flow [2021-03-25 14:40:19,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 36 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:40:19,564 INFO L241 Difference]: Finished difference. Result has 39 places, 27 transitions, 90 flow [2021-03-25 14:40:19,565 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2021-03-25 14:40:19,565 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -8 predicate places. [2021-03-25 14:40:19,565 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:40:19,565 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 27 transitions, 90 flow [2021-03-25 14:40:19,566 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 27 transitions, 90 flow [2021-03-25 14:40:19,566 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 27 transitions, 90 flow [2021-03-25 14:40:19,576 INFO L129 PetriNetUnfolder]: 23/75 cut-off events. [2021-03-25 14:40:19,576 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-03-25 14:40:19,586 INFO L84 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 75 events. 23/75 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 239 event pairs, 11 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 156. Up to 38 conditions per place. [2021-03-25 14:40:19,587 INFO L142 LiptonReduction]: Number of co-enabled transitions 266 [2021-03-25 14:40:20,057 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-03-25 14:40:20,179 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-25 14:40:20,434 WARN L205 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-03-25 14:40:20,551 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-25 14:40:20,554 INFO L154 LiptonReduction]: Checked pairs total: 768 [2021-03-25 14:40:20,554 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:40:20,554 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 989 [2021-03-25 14:40:20,555 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 86 flow [2021-03-25 14:40:20,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 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-03-25 14:40:20,555 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:40:20,556 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:40:20,556 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:40:20,556 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:40:20,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:40:20,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1693879739, now seen corresponding path program 1 times [2021-03-25 14:40:20,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:40:20,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724497650] [2021-03-25 14:40:20,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:40:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:40:20,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:20,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:40:20,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:20,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:40:20,654 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:40:20,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:40:20,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:20,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:40:20,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:40:20,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724497650] [2021-03-25 14:40:20,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:40:20,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:40:20,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278295] [2021-03-25 14:40:20,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:40:20,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:40:20,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:40:20,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:40:20,667 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 180 [2021-03-25 14:40:20,667 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 146.8) internal successors, (734), 5 states have internal predecessors, (734), 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-03-25 14:40:20,667 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:40:20,667 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 180 [2021-03-25 14:40:20,667 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:40:20,708 INFO L129 PetriNetUnfolder]: 16/61 cut-off events. [2021-03-25 14:40:20,709 INFO L130 PetriNetUnfolder]: For 41/50 co-relation queries the response was YES. [2021-03-25 14:40:20,710 INFO L84 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 61 events. 16/61 cut-off events. For 41/50 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 170 event pairs, 2 based on Foata normal form. 12/68 useless extension candidates. Maximal degree in co-relation 170. Up to 35 conditions per place. [2021-03-25 14:40:20,710 INFO L132 encePairwiseOnDemand]: 174/180 looper letters, 5 selfloop transitions, 7 changer transitions 7/35 dead transitions. [2021-03-25 14:40:20,710 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 35 transitions, 182 flow [2021-03-25 14:40:20,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:40:20,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:40:20,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 897 transitions. [2021-03-25 14:40:20,714 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8305555555555556 [2021-03-25 14:40:20,714 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 897 transitions. [2021-03-25 14:40:20,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 897 transitions. [2021-03-25 14:40:20,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:40:20,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 897 transitions. [2021-03-25 14:40:20,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 149.5) internal successors, (897), 6 states have internal predecessors, (897), 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-03-25 14:40:20,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 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-03-25 14:40:20,717 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 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-03-25 14:40:20,717 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 86 flow. Second operand 6 states and 897 transitions. [2021-03-25 14:40:20,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 35 transitions, 182 flow [2021-03-25 14:40:20,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 35 transitions, 176 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:40:20,720 INFO L241 Difference]: Finished difference. Result has 40 places, 28 transitions, 136 flow [2021-03-25 14:40:20,720 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=136, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2021-03-25 14:40:20,720 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -7 predicate places. [2021-03-25 14:40:20,720 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:40:20,720 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 28 transitions, 136 flow [2021-03-25 14:40:20,725 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 28 transitions, 136 flow [2021-03-25 14:40:20,725 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 28 transitions, 136 flow [2021-03-25 14:40:20,734 INFO L129 PetriNetUnfolder]: 11/49 cut-off events. [2021-03-25 14:40:20,734 INFO L130 PetriNetUnfolder]: For 68/74 co-relation queries the response was YES. [2021-03-25 14:40:20,734 INFO L84 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 49 events. 11/49 cut-off events. For 68/74 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 114 event pairs, 2 based on Foata normal form. 3/47 useless extension candidates. Maximal degree in co-relation 137. Up to 23 conditions per place. [2021-03-25 14:40:20,734 INFO L142 LiptonReduction]: Number of co-enabled transitions 266 [2021-03-25 14:40:20,736 INFO L154 LiptonReduction]: Checked pairs total: 270 [2021-03-25 14:40:20,736 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:40:20,736 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16 [2021-03-25 14:40:20,736 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 136 flow [2021-03-25 14:40:20,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 146.8) internal successors, (734), 5 states have internal predecessors, (734), 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-03-25 14:40:20,737 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:40:20,737 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:40:20,737 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:40:20,737 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:40:20,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:40:20,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1461234313, now seen corresponding path program 1 times [2021-03-25 14:40:20,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:40:20,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655704112] [2021-03-25 14:40:20,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:40:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:40:20,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:20,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:40:20,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:20,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:40:20,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:20,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:40:20,837 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:40:20,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:40:20,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:20,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:40:20,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-03-25 14:40:20,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655704112] [2021-03-25 14:40:20,843 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:40:20,843 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:40:20,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364315324] [2021-03-25 14:40:20,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:40:20,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:40:20,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:40:20,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:40:20,845 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 180 [2021-03-25 14:40:20,846 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 136 flow. Second operand has 6 states, 6 states have (on average 146.83333333333334) internal successors, (881), 6 states have internal predecessors, (881), 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-03-25 14:40:20,846 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:40:20,846 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 180 [2021-03-25 14:40:20,846 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:40:20,895 INFO L129 PetriNetUnfolder]: 7/37 cut-off events. [2021-03-25 14:40:20,895 INFO L130 PetriNetUnfolder]: For 87/107 co-relation queries the response was YES. [2021-03-25 14:40:20,895 INFO L84 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 37 events. 7/37 cut-off events. For 87/107 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 14/49 useless extension candidates. Maximal degree in co-relation 124. Up to 20 conditions per place. [2021-03-25 14:40:20,896 INFO L132 encePairwiseOnDemand]: 174/180 looper letters, 2 selfloop transitions, 10 changer transitions 5/32 dead transitions. [2021-03-25 14:40:20,896 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 32 transitions, 204 flow [2021-03-25 14:40:20,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:40:20,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:40:20,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1040 transitions. [2021-03-25 14:40:20,913 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8253968253968254 [2021-03-25 14:40:20,913 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1040 transitions. [2021-03-25 14:40:20,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1040 transitions. [2021-03-25 14:40:20,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:40:20,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1040 transitions. [2021-03-25 14:40:20,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 148.57142857142858) internal successors, (1040), 7 states have internal predecessors, (1040), 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-03-25 14:40:20,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 180.0) internal successors, (1440), 8 states have internal predecessors, (1440), 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-03-25 14:40:20,917 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 180.0) internal successors, (1440), 8 states have internal predecessors, (1440), 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-03-25 14:40:20,918 INFO L185 Difference]: Start difference. First operand has 38 places, 28 transitions, 136 flow. Second operand 7 states and 1040 transitions. [2021-03-25 14:40:20,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 32 transitions, 204 flow [2021-03-25 14:40:20,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 32 transitions, 168 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-03-25 14:40:20,919 INFO L241 Difference]: Finished difference. Result has 43 places, 27 transitions, 136 flow [2021-03-25 14:40:20,919 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2021-03-25 14:40:20,919 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2021-03-25 14:40:20,919 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:40:20,919 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 27 transitions, 136 flow [2021-03-25 14:40:20,920 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 27 transitions, 136 flow [2021-03-25 14:40:20,920 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 27 transitions, 136 flow [2021-03-25 14:40:20,923 INFO L129 PetriNetUnfolder]: 5/30 cut-off events. [2021-03-25 14:40:20,923 INFO L130 PetriNetUnfolder]: For 33/36 co-relation queries the response was YES. [2021-03-25 14:40:20,923 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 30 events. 5/30 cut-off events. For 33/36 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 75. Up to 11 conditions per place. [2021-03-25 14:40:20,923 INFO L142 LiptonReduction]: Number of co-enabled transitions 182 [2021-03-25 14:40:21,116 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-03-25 14:40:21,265 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:40:21,383 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:40:21,672 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2021-03-25 14:40:21,801 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2021-03-25 14:40:21,804 INFO L154 LiptonReduction]: Checked pairs total: 654 [2021-03-25 14:40:21,804 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:40:21,804 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 885 [2021-03-25 14:40:21,805 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 132 flow [2021-03-25 14:40:21,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 146.83333333333334) internal successors, (881), 6 states have internal predecessors, (881), 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-03-25 14:40:21,805 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:40:21,805 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:40:21,805 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:40:21,805 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:40:21,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:40:21,806 INFO L82 PathProgramCache]: Analyzing trace with hash -892406038, now seen corresponding path program 1 times [2021-03-25 14:40:21,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:40:21,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216895857] [2021-03-25 14:40:21,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:40:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:40:21,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:21,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:40:21,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:21,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:40:21,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:21,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:40:21,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:40:21,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216895857] [2021-03-25 14:40:21,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:40:21,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:40:21,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86087954] [2021-03-25 14:40:21,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:40:21,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:40:21,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:40:21,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:40:21,901 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 182 [2021-03-25 14:40:21,902 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 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-03-25 14:40:21,902 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:40:21,902 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 182 [2021-03-25 14:40:21,902 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:40:21,934 INFO L129 PetriNetUnfolder]: 10/44 cut-off events. [2021-03-25 14:40:21,934 INFO L130 PetriNetUnfolder]: For 85/93 co-relation queries the response was YES. [2021-03-25 14:40:21,934 INFO L84 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 44 events. 10/44 cut-off events. For 85/93 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 102 event pairs, 0 based on Foata normal form. 5/47 useless extension candidates. Maximal degree in co-relation 126. Up to 20 conditions per place. [2021-03-25 14:40:21,935 INFO L132 encePairwiseOnDemand]: 179/182 looper letters, 3 selfloop transitions, 1 changer transitions 1/26 dead transitions. [2021-03-25 14:40:21,935 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 26 transitions, 144 flow [2021-03-25 14:40:21,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:40:21,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:40:21,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 626 transitions. [2021-03-25 14:40:21,937 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8598901098901099 [2021-03-25 14:40:21,937 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 626 transitions. [2021-03-25 14:40:21,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 626 transitions. [2021-03-25 14:40:21,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:40:21,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 626 transitions. [2021-03-25 14:40:21,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 156.5) internal successors, (626), 4 states have internal predecessors, (626), 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-03-25 14:40:21,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 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-03-25 14:40:21,941 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 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-03-25 14:40:21,941 INFO L185 Difference]: Start difference. First operand has 38 places, 25 transitions, 132 flow. Second operand 4 states and 626 transitions. [2021-03-25 14:40:21,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 26 transitions, 144 flow [2021-03-25 14:40:21,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 26 transitions, 106 flow, removed 12 selfloop flow, removed 6 redundant places. [2021-03-25 14:40:21,946 INFO L241 Difference]: Finished difference. Result has 37 places, 25 transitions, 101 flow [2021-03-25 14:40:21,946 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2021-03-25 14:40:21,946 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -10 predicate places. [2021-03-25 14:40:21,946 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:40:21,946 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 25 transitions, 101 flow [2021-03-25 14:40:21,946 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 25 transitions, 101 flow [2021-03-25 14:40:21,946 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 25 transitions, 101 flow [2021-03-25 14:40:21,951 INFO L129 PetriNetUnfolder]: 6/34 cut-off events. [2021-03-25 14:40:21,951 INFO L130 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2021-03-25 14:40:21,951 INFO L84 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 34 events. 6/34 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 0 based on Foata normal form. 1/33 useless extension candidates. Maximal degree in co-relation 70. Up to 10 conditions per place. [2021-03-25 14:40:21,951 INFO L142 LiptonReduction]: Number of co-enabled transitions 170 [2021-03-25 14:40:22,576 WARN L205 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-25 14:40:23,082 WARN L205 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 175 [2021-03-25 14:40:24,400 WARN L205 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 14:40:24,915 WARN L205 SmtUtils]: Spent 513.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 14:40:24,947 INFO L154 LiptonReduction]: Checked pairs total: 317 [2021-03-25 14:40:24,948 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:40:24,948 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3002 [2021-03-25 14:40:24,948 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 99 flow [2021-03-25 14:40:24,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 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-03-25 14:40:24,948 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:40:24,948 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:40:24,949 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:40:24,949 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:40:24,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:40:24,949 INFO L82 PathProgramCache]: Analyzing trace with hash 300000008, now seen corresponding path program 1 times [2021-03-25 14:40:24,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:40:24,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258823499] [2021-03-25 14:40:24,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:40:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:40:25,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:25,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:40:25,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:25,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:40:25,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:25,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:40:25,066 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-03-25 14:40:25,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:40:25,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:40:25,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258823499] [2021-03-25 14:40:25,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:40:25,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:40:25,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643199979] [2021-03-25 14:40:25,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:40:25,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:40:25,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:40:25,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:40:25,075 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 183 [2021-03-25 14:40:25,075 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 150.2) internal successors, (751), 5 states have internal predecessors, (751), 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-03-25 14:40:25,075 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:40:25,075 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 183 [2021-03-25 14:40:25,076 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:40:25,100 INFO L129 PetriNetUnfolder]: 19/75 cut-off events. [2021-03-25 14:40:25,100 INFO L130 PetriNetUnfolder]: For 96/113 co-relation queries the response was YES. [2021-03-25 14:40:25,100 INFO L84 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 75 events. 19/75 cut-off events. For 96/113 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 299 event pairs, 1 based on Foata normal form. 10/80 useless extension candidates. Maximal degree in co-relation 178. Up to 20 conditions per place. [2021-03-25 14:40:25,100 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 5 selfloop transitions, 1 changer transitions 4/28 dead transitions. [2021-03-25 14:40:25,100 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 28 transitions, 135 flow [2021-03-25 14:40:25,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:40:25,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:40:25,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 607 transitions. [2021-03-25 14:40:25,102 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8292349726775956 [2021-03-25 14:40:25,102 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 607 transitions. [2021-03-25 14:40:25,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 607 transitions. [2021-03-25 14:40:25,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:40:25,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 607 transitions. [2021-03-25 14:40:25,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 151.75) internal successors, (607), 4 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-03-25 14:40:25,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 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-03-25 14:40:25,104 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 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-03-25 14:40:25,104 INFO L185 Difference]: Start difference. First operand has 35 places, 24 transitions, 99 flow. Second operand 4 states and 607 transitions. [2021-03-25 14:40:25,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 28 transitions, 135 flow [2021-03-25 14:40:25,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 28 transitions, 130 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:40:25,105 INFO L241 Difference]: Finished difference. Result has 38 places, 24 transitions, 103 flow [2021-03-25 14:40:25,105 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=103, PETRI_PLACES=38, PETRI_TRANSITIONS=24} [2021-03-25 14:40:25,106 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -9 predicate places. [2021-03-25 14:40:25,106 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:40:25,106 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 24 transitions, 103 flow [2021-03-25 14:40:25,106 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 24 transitions, 103 flow [2021-03-25 14:40:25,106 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 24 transitions, 103 flow [2021-03-25 14:40:25,110 INFO L129 PetriNetUnfolder]: 7/41 cut-off events. [2021-03-25 14:40:25,110 INFO L130 PetriNetUnfolder]: For 25/26 co-relation queries the response was YES. [2021-03-25 14:40:25,110 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 41 events. 7/41 cut-off events. For 25/26 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 116 event pairs, 0 based on Foata normal form. 1/39 useless extension candidates. Maximal degree in co-relation 90. Up to 12 conditions per place. [2021-03-25 14:40:25,110 INFO L142 LiptonReduction]: Number of co-enabled transitions 140 [2021-03-25 14:40:25,281 INFO L154 LiptonReduction]: Checked pairs total: 252 [2021-03-25 14:40:25,281 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:40:25,281 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 175 [2021-03-25 14:40:25,282 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 23 transitions, 101 flow [2021-03-25 14:40:25,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 150.2) internal successors, (751), 5 states have internal predecessors, (751), 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-03-25 14:40:25,282 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:40:25,282 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:40:25,282 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:40:25,282 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:40:25,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:40:25,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1543831100, now seen corresponding path program 1 times [2021-03-25 14:40:25,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:40:25,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377674538] [2021-03-25 14:40:25,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:40:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:40:25,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:25,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:40:25,421 INFO L142 QuantifierPusher]: treesize reduction 2, result has 91.7 percent of original size [2021-03-25 14:40:25,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 14:40:25,436 INFO L142 QuantifierPusher]: treesize reduction 9, result has 70.0 percent of original size [2021-03-25 14:40:25,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:40:25,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:25,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:40:25,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:25,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:40:25,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:40:25,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377674538] [2021-03-25 14:40:25,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:40:25,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:40:25,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584796282] [2021-03-25 14:40:25,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:40:25,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:40:25,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:40:25,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:40:25,463 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 184 [2021-03-25 14:40:25,464 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 23 transitions, 101 flow. Second operand has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 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-03-25 14:40:25,464 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:40:25,464 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 184 [2021-03-25 14:40:25,464 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:40:25,593 INFO L129 PetriNetUnfolder]: 46/143 cut-off events. [2021-03-25 14:40:25,593 INFO L130 PetriNetUnfolder]: For 170/207 co-relation queries the response was YES. [2021-03-25 14:40:25,594 INFO L84 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 143 events. 46/143 cut-off events. For 170/207 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 698 event pairs, 4 based on Foata normal form. 21/157 useless extension candidates. Maximal degree in co-relation 364. Up to 39 conditions per place. [2021-03-25 14:40:25,594 INFO L132 encePairwiseOnDemand]: 178/184 looper letters, 7 selfloop transitions, 5 changer transitions 5/33 dead transitions. [2021-03-25 14:40:25,594 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 33 transitions, 167 flow [2021-03-25 14:40:25,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:40:25,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:40:25,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 922 transitions. [2021-03-25 14:40:25,598 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7158385093167702 [2021-03-25 14:40:25,598 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 922 transitions. [2021-03-25 14:40:25,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 922 transitions. [2021-03-25 14:40:25,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:40:25,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 922 transitions. [2021-03-25 14:40:25,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.71428571428572) internal successors, (922), 7 states have internal predecessors, (922), 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-03-25 14:40:25,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 184.0) internal successors, (1472), 8 states have internal predecessors, (1472), 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-03-25 14:40:25,604 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 184.0) internal successors, (1472), 8 states have internal predecessors, (1472), 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-03-25 14:40:25,604 INFO L185 Difference]: Start difference. First operand has 36 places, 23 transitions, 101 flow. Second operand 7 states and 922 transitions. [2021-03-25 14:40:25,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 33 transitions, 167 flow [2021-03-25 14:40:25,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 33 transitions, 162 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-25 14:40:25,607 INFO L241 Difference]: Finished difference. Result has 43 places, 25 transitions, 133 flow [2021-03-25 14:40:25,607 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=133, PETRI_PLACES=43, PETRI_TRANSITIONS=25} [2021-03-25 14:40:25,607 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2021-03-25 14:40:25,608 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:40:25,608 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 25 transitions, 133 flow [2021-03-25 14:40:25,608 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 25 transitions, 133 flow [2021-03-25 14:40:25,608 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 25 transitions, 133 flow [2021-03-25 14:40:25,615 INFO L129 PetriNetUnfolder]: 18/72 cut-off events. [2021-03-25 14:40:25,615 INFO L130 PetriNetUnfolder]: For 77/83 co-relation queries the response was YES. [2021-03-25 14:40:25,616 INFO L84 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 72 events. 18/72 cut-off events. For 77/83 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 256 event pairs, 3 based on Foata normal form. 4/71 useless extension candidates. Maximal degree in co-relation 194. Up to 23 conditions per place. [2021-03-25 14:40:25,616 INFO L142 LiptonReduction]: Number of co-enabled transitions 122 [2021-03-25 14:40:25,617 INFO L154 LiptonReduction]: Checked pairs total: 39 [2021-03-25 14:40:25,617 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:40:25,618 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-03-25 14:40:25,618 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 25 transitions, 133 flow [2021-03-25 14:40:25,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 130.0) internal successors, (910), 7 states have internal predecessors, (910), 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-03-25 14:40:25,618 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:40:25,618 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:40:25,618 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:40:25,619 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:40:25,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:40:25,619 INFO L82 PathProgramCache]: Analyzing trace with hash 415395651, now seen corresponding path program 1 times [2021-03-25 14:40:25,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:40:25,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178945431] [2021-03-25 14:40:25,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:40:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:40:25,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:25,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:40:25,701 INFO L142 QuantifierPusher]: treesize reduction 10, result has 77.3 percent of original size [2021-03-25 14:40:25,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-25 14:40:25,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:25,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:40:25,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:25,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:40:25,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:40:25,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:40:25,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:40:25,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178945431] [2021-03-25 14:40:25,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:40:25,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:40:25,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671553352] [2021-03-25 14:40:25,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:40:25,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:40:25,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:40:25,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:40:25,743 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 184 [2021-03-25 14:40:25,744 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 25 transitions, 133 flow. Second operand has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 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-03-25 14:40:25,744 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:40:25,744 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 184 [2021-03-25 14:40:25,744 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:40:25,869 INFO L129 PetriNetUnfolder]: 38/121 cut-off events. [2021-03-25 14:40:25,869 INFO L130 PetriNetUnfolder]: For 254/293 co-relation queries the response was YES. [2021-03-25 14:40:25,870 INFO L84 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 121 events. 38/121 cut-off events. For 254/293 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 540 event pairs, 4 based on Foata normal form. 21/136 useless extension candidates. Maximal degree in co-relation 358. Up to 31 conditions per place. [2021-03-25 14:40:25,871 INFO L132 encePairwiseOnDemand]: 179/184 looper letters, 5 selfloop transitions, 5 changer transitions 5/31 dead transitions. [2021-03-25 14:40:25,871 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 31 transitions, 187 flow [2021-03-25 14:40:25,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:40:25,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:40:25,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 783 transitions. [2021-03-25 14:40:25,873 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7092391304347826 [2021-03-25 14:40:25,873 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 783 transitions. [2021-03-25 14:40:25,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 783 transitions. [2021-03-25 14:40:25,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:40:25,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 783 transitions. [2021-03-25 14:40:25,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 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-03-25 14:40:25,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 states have internal predecessors, (1288), 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-03-25 14:40:25,877 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 states have internal predecessors, (1288), 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-03-25 14:40:25,878 INFO L185 Difference]: Start difference. First operand has 41 places, 25 transitions, 133 flow. Second operand 6 states and 783 transitions. [2021-03-25 14:40:25,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 31 transitions, 187 flow [2021-03-25 14:40:25,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 172 flow, removed 4 selfloop flow, removed 5 redundant places. [2021-03-25 14:40:25,879 INFO L241 Difference]: Finished difference. Result has 42 places, 25 transitions, 135 flow [2021-03-25 14:40:25,879 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=135, PETRI_PLACES=42, PETRI_TRANSITIONS=25} [2021-03-25 14:40:25,879 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -5 predicate places. [2021-03-25 14:40:25,879 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:40:25,879 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 25 transitions, 135 flow [2021-03-25 14:40:25,880 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 25 transitions, 135 flow [2021-03-25 14:40:25,880 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 25 transitions, 135 flow [2021-03-25 14:40:25,887 INFO L129 PetriNetUnfolder]: 17/71 cut-off events. [2021-03-25 14:40:25,887 INFO L130 PetriNetUnfolder]: For 86/91 co-relation queries the response was YES. [2021-03-25 14:40:25,888 INFO L84 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 71 events. 17/71 cut-off events. For 86/91 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 248 event pairs, 2 based on Foata normal form. 4/73 useless extension candidates. Maximal degree in co-relation 196. Up to 23 conditions per place. [2021-03-25 14:40:25,888 INFO L142 LiptonReduction]: Number of co-enabled transitions 116 [2021-03-25 14:40:25,889 INFO L154 LiptonReduction]: Checked pairs total: 39 [2021-03-25 14:40:25,889 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:40:25,890 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11 [2021-03-25 14:40:25,890 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 25 transitions, 135 flow [2021-03-25 14:40:25,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 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-03-25 14:40:25,891 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:40:25,891 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:40:25,891 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:40:25,891 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:40:25,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:40:25,891 INFO L82 PathProgramCache]: Analyzing trace with hash 687315543, now seen corresponding path program 2 times [2021-03-25 14:40:25,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:40:25,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882036160] [2021-03-25 14:40:25,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:40:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:40:25,948 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:40:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:40:25,987 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:40:26,006 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:40:26,007 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:40:26,007 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:40:26,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:40:26 BasicIcfg [2021-03-25 14:40:26,062 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:40:26,063 INFO L168 Benchmark]: Toolchain (without parser) took 12428.52 ms. Allocated memory was 377.5 MB in the beginning and 643.8 MB in the end (delta: 266.3 MB). Free memory was 340.9 MB in the beginning and 427.5 MB in the end (delta: -86.6 MB). Peak memory consumption was 181.6 MB. Max. memory is 16.0 GB. [2021-03-25 14:40:26,063 INFO L168 Benchmark]: CDTParser took 0.82 ms. Allocated memory is still 377.5 MB. Free memory was 358.7 MB in the beginning and 358.6 MB in the end (delta: 136.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:40:26,063 INFO L168 Benchmark]: CACSL2BoogieTranslator took 418.67 ms. Allocated memory is still 377.5 MB. Free memory was 340.7 MB in the beginning and 337.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 10.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:40:26,063 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.70 ms. Allocated memory is still 377.5 MB. Free memory was 337.8 MB in the beginning and 335.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:40:26,064 INFO L168 Benchmark]: Boogie Preprocessor took 27.77 ms. Allocated memory is still 377.5 MB. Free memory was 335.7 MB in the beginning and 332.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:40:26,064 INFO L168 Benchmark]: RCFGBuilder took 1471.85 ms. Allocated memory is still 377.5 MB. Free memory was 332.5 MB in the beginning and 275.8 MB in the end (delta: 56.7 MB). Peak memory consumption was 155.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:40:26,064 INFO L168 Benchmark]: TraceAbstraction took 10450.38 ms. Allocated memory was 377.5 MB in the beginning and 643.8 MB in the end (delta: 266.3 MB). Free memory was 275.8 MB in the beginning and 427.5 MB in the end (delta: -151.7 MB). Peak memory consumption was 113.6 MB. Max. memory is 16.0 GB. [2021-03-25 14:40:26,065 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.82 ms. Allocated memory is still 377.5 MB. Free memory was 358.7 MB in the beginning and 358.6 MB in the end (delta: 136.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 418.67 ms. Allocated memory is still 377.5 MB. Free memory was 340.7 MB in the beginning and 337.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 10.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 55.70 ms. Allocated memory is still 377.5 MB. Free memory was 337.8 MB in the beginning and 335.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 27.77 ms. Allocated memory is still 377.5 MB. Free memory was 335.7 MB in the beginning and 332.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1471.85 ms. Allocated memory is still 377.5 MB. Free memory was 332.5 MB in the beginning and 275.8 MB in the end (delta: 56.7 MB). Peak memory consumption was 155.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 10450.38 ms. Allocated memory was 377.5 MB in the beginning and 643.8 MB in the end (delta: 266.3 MB). Free memory was 275.8 MB in the beginning and 427.5 MB in the end (delta: -151.7 MB). Peak memory consumption was 113.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2245.2ms, 104 PlacesBefore, 47 PlacesAfterwards, 96 TransitionsBefore, 38 TransitionsAfterwards, 1694 CoEnabledTransitionPairs, 6 FixpointIterations, 27 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 68 TotalNumberOfCompositions, 3077 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1259, positive: 1175, positive conditional: 0, positive unconditional: 1175, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 952, positive: 919, positive conditional: 0, positive unconditional: 919, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 952, positive: 919, positive conditional: 0, positive unconditional: 919, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 952, positive: 918, positive conditional: 0, positive unconditional: 918, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 34, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 367, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 363, negative conditional: 0, negative unconditional: 363, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1259, positive: 256, positive conditional: 0, positive unconditional: 256, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 952, unknown conditional: 0, unknown unconditional: 952] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 78, Positive conditional cache size: 0, Positive unconditional cache size: 78, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 938.0ms, 44 PlacesBefore, 34 PlacesAfterwards, 35 TransitionsBefore, 25 TransitionsAfterwards, 312 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 1272 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 359, positive: 274, positive conditional: 0, positive unconditional: 274, negative: 85, negative conditional: 0, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 73, positive: 58, positive conditional: 0, positive unconditional: 58, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 73, positive: 58, positive conditional: 0, positive unconditional: 58, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 73, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 182, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 172, negative conditional: 0, negative unconditional: 172, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 359, positive: 216, positive conditional: 0, positive unconditional: 216, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 73, unknown conditional: 0, unknown unconditional: 73] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 988.6ms, 39 PlacesBefore, 34 PlacesAfterwards, 27 TransitionsBefore, 25 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 768 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 135, positive: 87, positive conditional: 0, positive unconditional: 87, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 135, positive: 83, positive conditional: 0, positive unconditional: 83, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 135, Positive cache size: 103, Positive conditional cache size: 0, Positive unconditional cache size: 103, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.3ms, 40 PlacesBefore, 38 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 270 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 55, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 7, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 7, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 55, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 142, Positive cache size: 110, Positive conditional cache size: 0, Positive unconditional cache size: 110, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 884.2ms, 43 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 25 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 654 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 169, positive: 115, positive conditional: 0, positive unconditional: 115, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 5, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 5, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 169, positive: 110, positive conditional: 0, positive unconditional: 110, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 92, Positive conditional cache size: 0, Positive unconditional cache size: 92, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3001.3ms, 37 PlacesBefore, 35 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 170 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 317 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 21, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 59, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 80, Positive conditional cache size: 0, Positive unconditional cache size: 80, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 175.1ms, 38 PlacesBefore, 36 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 252 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 37, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 150, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 150, negative conditional: 0, negative unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 37, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.7ms, 43 PlacesBefore, 41 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 122 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 39 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 5, positive: 1, positive conditional: 0, positive unconditional: 1, 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): 83, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.9ms, 42 PlacesBefore, 41 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 116 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 39 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): 83, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - CounterExampleResult [Line: 18]: 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_p2_EAX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L723] 0 int z = 0; [L724] 0 _Bool z$flush_delayed; [L725] 0 int z$mem_tmp; [L726] 0 _Bool z$r_buff0_thd0; [L727] 0 _Bool z$r_buff0_thd1; [L728] 0 _Bool z$r_buff0_thd2; [L729] 0 _Bool z$r_buff0_thd3; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$read_delayed; [L735] 0 int *z$read_delayed_var; [L736] 0 int z$w_buff0; [L737] 0 _Bool z$w_buff0_used; [L738] 0 int z$w_buff1; [L739] 0 _Bool z$w_buff1_used; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L835] 0 pthread_t t1579; [L836] FCALL, FORK 0 pthread_create(&t1579, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] 0 pthread_t t1580; [L838] FCALL, FORK 0 pthread_create(&t1580, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] 0 pthread_t t1581; [L840] FCALL, FORK 0 pthread_create(&t1581, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 x = 1 [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] 3 y = 1 [L797] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 3 z$flush_delayed = weak$$choice2 [L800] 3 z$mem_tmp = z [L801] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L801] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L802] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L802] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L803] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L803] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L804] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L804] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L805] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L805] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L806] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L807] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] 3 __unbuffered_p2_EAX = z [L809] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L809] 3 z = z$flush_delayed ? z$mem_tmp : z [L810] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L813] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L813] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L813] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L814] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L815] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L816] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L817] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L760] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L762] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L764] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L780] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L780] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L782] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L783] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L784] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L846] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L846] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L846] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L846] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L850] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L853] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 10302.8ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 699.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2312.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 27 SDtfs, 20 SDslu, 17 SDs, 0 SdLazy, 226 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 232.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 166.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=3, InterpolantAutomatonStates: 42, 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: 28.4ms SsaConstructionTime, 421.5ms SatisfiabilityAnalysisTime, 582.9ms InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 132 ConstructedInterpolants, 0 QuantifiedInterpolants, 679 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...