/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/safe010_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:51:50,507 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:51:50,508 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:51:50,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:51:50,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:51:50,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:51:50,549 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:51:50,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:51:50,556 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:51:50,560 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:51:50,561 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:51:50,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:51:50,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:51:50,564 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:51:50,565 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:51:50,567 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:51:50,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:51:50,569 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:51:50,572 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:51:50,579 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:51:50,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:51:50,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:51:50,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:51:50,585 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:51:50,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:51:50,591 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:51:50,591 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:51:50,592 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:51:50,593 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:51:50,593 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:51:50,594 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:51:50,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:51:50,600 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:51:50,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:51:50,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:51:50,601 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:51:50,601 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:51:50,602 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:51:50,602 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:51:50,602 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:51:50,603 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:51:50,606 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:51:50,636 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:51:50,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:51:50,640 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:51:50,640 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:51:50,640 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:51:50,641 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:51:50,641 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:51:50,641 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:51:50,641 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:51:50,642 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:51:50,642 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:51:50,643 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:51:50,643 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:51:50,643 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:51:50,643 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:51:50,643 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:51:50,643 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:51:50,644 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:51:50,644 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:51:50,644 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:51:50,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:51:50,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:51:50,645 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:51:50,645 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:51:50,645 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:51:50,645 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:51:50,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:51:50,645 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:51:50,646 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:51:50,646 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:51:50,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:51:50,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:51:50,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:51:50,981 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:51:50,982 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:51:50,982 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_power.opt.i [2021-03-25 14:51:51,047 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c3374b11/66c0bd8565be49a8872174146aad8350/FLAG0c7a992c1 [2021-03-25 14:51:51,513 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:51:51,513 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.opt.i [2021-03-25 14:51:51,527 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c3374b11/66c0bd8565be49a8872174146aad8350/FLAG0c7a992c1 [2021-03-25 14:51:51,858 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c3374b11/66c0bd8565be49a8872174146aad8350 [2021-03-25 14:51:51,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:51:51,862 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:51:51,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:51:51,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:51:51,869 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:51:51,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:51:51" (1/1) ... [2021-03-25 14:51:51,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78c87d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:51:51, skipping insertion in model container [2021-03-25 14:51:51,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:51:51" (1/1) ... [2021-03-25 14:51:51,876 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:51:51,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:51:52,037 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/safe010_power.opt.i[951,964] [2021-03-25 14:51:52,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:51:52,188 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:51:52,197 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_power.opt.i[951,964] [2021-03-25 14:51:52,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:51:52,293 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:51:52,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:51:52 WrapperNode [2021-03-25 14:51:52,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:51:52,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:51:52,295 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:51:52,296 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:51:52,301 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:51:52" (1/1) ... [2021-03-25 14:51:52,314 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:51:52" (1/1) ... [2021-03-25 14:51:52,340 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:51:52,341 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:51:52,341 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:51:52,341 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:51:52,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:51:52" (1/1) ... [2021-03-25 14:51:52,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:51:52" (1/1) ... [2021-03-25 14:51:52,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:51:52" (1/1) ... [2021-03-25 14:51:52,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:51:52" (1/1) ... [2021-03-25 14:51:52,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:51:52" (1/1) ... [2021-03-25 14:51:52,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:51:52" (1/1) ... [2021-03-25 14:51:52,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:51:52" (1/1) ... [2021-03-25 14:51:52,383 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:51:52,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:51:52,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:51:52,400 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:51:52,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:51:52" (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:51:52,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:51:52,456 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:51:52,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:51:52,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:51:52,457 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:51:52,457 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:51:52,457 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:51:52,457 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:51:52,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:51:52,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:51:52,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:51:52,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:51:52,459 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:51:54,015 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:51:54,015 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:51:54,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:51:54 BoogieIcfgContainer [2021-03-25 14:51:54,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:51:54,018 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:51:54,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:51:54,020 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:51:54,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:51:51" (1/3) ... [2021-03-25 14:51:54,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7030b132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:51:54, skipping insertion in model container [2021-03-25 14:51:54,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:51:52" (2/3) ... [2021-03-25 14:51:54,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7030b132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:51:54, skipping insertion in model container [2021-03-25 14:51:54,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:51:54" (3/3) ... [2021-03-25 14:51:54,022 INFO L111 eAbstractionObserver]: Analyzing ICFG safe010_power.opt.i [2021-03-25 14:51:54,049 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:51:54,053 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:51:54,054 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:51:54,077 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,077 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,077 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,077 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,078 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,078 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,078 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,078 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,078 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,079 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,079 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,079 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,080 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,082 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,082 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,082 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,082 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,082 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,083 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,084 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,085 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,085 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,085 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,087 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,087 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,088 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,089 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,089 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:51:54,091 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:51:54,106 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-25 14:51:54,123 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:51:54,123 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:51:54,123 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:51:54,123 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:51:54,123 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:51:54,123 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:51:54,123 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:51:54,124 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:51:54,132 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2021-03-25 14:51:54,157 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2021-03-25 14:51:54,158 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:51:54,160 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-25 14:51:54,160 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 80 transitions, 170 flow [2021-03-25 14:51:54,164 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 78 transitions, 162 flow [2021-03-25 14:51:54,165 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:51:54,175 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 78 transitions, 162 flow [2021-03-25 14:51:54,177 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 78 transitions, 162 flow [2021-03-25 14:51:54,179 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 162 flow [2021-03-25 14:51:54,191 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2021-03-25 14:51:54,191 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:51:54,192 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-25 14:51:54,194 INFO L142 LiptonReduction]: Number of co-enabled transitions 926 [2021-03-25 14:51:55,098 WARN L205 SmtUtils]: Spent 781.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2021-03-25 14:51:55,470 WARN L205 SmtUtils]: Spent 367.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2021-03-25 14:51:56,955 WARN L205 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 308 DAG size of output: 263 [2021-03-25 14:51:57,590 WARN L205 SmtUtils]: Spent 626.00 ms on a formula simplification that was a NOOP. DAG size: 260 [2021-03-25 14:51:58,423 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:51:58,767 WARN L205 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:51:58,873 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 14:52:00,263 WARN L205 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 183 [2021-03-25 14:52:00,554 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-03-25 14:52:01,138 WARN L205 SmtUtils]: Spent 582.00 ms on a formula simplification that was a NOOP. DAG size: 262 [2021-03-25 14:52:01,760 WARN L205 SmtUtils]: Spent 620.00 ms on a formula simplification that was a NOOP. DAG size: 262 [2021-03-25 14:52:01,769 INFO L154 LiptonReduction]: Checked pairs total: 1464 [2021-03-25 14:52:01,770 INFO L156 LiptonReduction]: Total number of compositions: 57 [2021-03-25 14:52:01,772 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7607 [2021-03-25 14:52:01,778 INFO L129 PetriNetUnfolder]: 0/9 cut-off events. [2021-03-25 14:52:01,778 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:01,778 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:01,779 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:01,779 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:01,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:01,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1967679308, now seen corresponding path program 1 times [2021-03-25 14:52:01,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:01,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035668390] [2021-03-25 14:52:01,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:02,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:02,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:52:02,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:02,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:02,021 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:52:02,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035668390] [2021-03-25 14:52:02,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:02,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:52:02,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141551397] [2021-03-25 14:52:02,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:52:02,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:02,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:52:02,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:52:02,041 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 137 [2021-03-25 14:52:02,043 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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:52:02,043 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:02,043 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 137 [2021-03-25 14:52:02,044 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:02,094 INFO L129 PetriNetUnfolder]: 23/92 cut-off events. [2021-03-25 14:52:02,094 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:02,094 INFO L84 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 92 events. 23/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 340 event pairs, 16 based on Foata normal form. 5/89 useless extension candidates. Maximal degree in co-relation 133. Up to 37 conditions per place. [2021-03-25 14:52:02,098 INFO L132 encePairwiseOnDemand]: 133/137 looper letters, 7 selfloop transitions, 2 changer transitions 5/30 dead transitions. [2021-03-25 14:52:02,098 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 88 flow [2021-03-25 14:52:02,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:52:02,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:52:02,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2021-03-25 14:52:02,115 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8661800486618005 [2021-03-25 14:52:02,116 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2021-03-25 14:52:02,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2021-03-25 14:52:02,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:02,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2021-03-25 14:52:02,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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:52:02,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 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:52:02,138 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 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:52:02,139 INFO L185 Difference]: Start difference. First operand has 35 places, 29 transitions, 64 flow. Second operand 3 states and 356 transitions. [2021-03-25 14:52:02,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 88 flow [2021-03-25 14:52:02,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:52:02,144 INFO L241 Difference]: Finished difference. Result has 33 places, 22 transitions, 52 flow [2021-03-25 14:52:02,146 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2021-03-25 14:52:02,147 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2021-03-25 14:52:02,147 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:02,149 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 52 flow [2021-03-25 14:52:02,150 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 52 flow [2021-03-25 14:52:02,151 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 29 places, 22 transitions, 52 flow [2021-03-25 14:52:02,164 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-25 14:52:02,164 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:02,164 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:52:02,165 INFO L142 LiptonReduction]: Number of co-enabled transitions 128 [2021-03-25 14:52:02,422 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2021-03-25 14:52:03,194 WARN L205 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 184 [2021-03-25 14:52:03,523 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-25 14:52:04,145 WARN L205 SmtUtils]: Spent 619.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-25 14:52:04,755 WARN L205 SmtUtils]: Spent 609.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-25 14:52:04,967 INFO L154 LiptonReduction]: Checked pairs total: 408 [2021-03-25 14:52:04,967 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 14:52:04,968 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2821 [2021-03-25 14:52:04,969 INFO L480 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 42 flow [2021-03-25 14:52:04,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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:52:04,969 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:04,969 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:04,969 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:52:04,970 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:04,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:04,970 INFO L82 PathProgramCache]: Analyzing trace with hash 434742666, now seen corresponding path program 1 times [2021-03-25 14:52:04,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:04,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902575517] [2021-03-25 14:52:04,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:05,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:05,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:52:05,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:05,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:05,103 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:52:05,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:52:05,114 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:52:05,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902575517] [2021-03-25 14:52:05,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:05,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:52:05,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725236549] [2021-03-25 14:52:05,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:52:05,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:05,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:52:05,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:52:05,125 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 142 [2021-03-25 14:52:05,126 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 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:52:05,126 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:05,126 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 142 [2021-03-25 14:52:05,126 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:05,144 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-03-25 14:52:05,144 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:05,144 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 17 events. 0/17 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 1/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:52:05,145 INFO L132 encePairwiseOnDemand]: 139/142 looper letters, 1 selfloop transitions, 2 changer transitions 0/17 dead transitions. [2021-03-25 14:52:05,145 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 17 transitions, 48 flow [2021-03-25 14:52:05,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:52:05,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:52:05,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2021-03-25 14:52:05,147 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8474178403755869 [2021-03-25 14:52:05,148 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2021-03-25 14:52:05,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2021-03-25 14:52:05,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:05,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2021-03-25 14:52:05,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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:52:05,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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:52:05,158 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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:52:05,158 INFO L185 Difference]: Start difference. First operand has 24 places, 17 transitions, 42 flow. Second operand 3 states and 361 transitions. [2021-03-25 14:52:05,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 17 transitions, 48 flow [2021-03-25 14:52:05,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 17 transitions, 44 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:52:05,159 INFO L241 Difference]: Finished difference. Result has 25 places, 17 transitions, 46 flow [2021-03-25 14:52:05,159 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2021-03-25 14:52:05,161 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -10 predicate places. [2021-03-25 14:52:05,162 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:05,162 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 17 transitions, 46 flow [2021-03-25 14:52:05,162 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 17 transitions, 46 flow [2021-03-25 14:52:05,162 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 25 places, 17 transitions, 46 flow [2021-03-25 14:52:05,166 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-03-25 14:52:05,166 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:05,166 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 17 events. 0/17 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:52:05,167 INFO L142 LiptonReduction]: Number of co-enabled transitions 94 [2021-03-25 14:52:05,274 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-03-25 14:52:05,387 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-03-25 14:52:05,492 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-03-25 14:52:05,852 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2021-03-25 14:52:05,970 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-25 14:52:06,214 WARN L205 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2021-03-25 14:52:06,333 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-25 14:52:06,335 INFO L154 LiptonReduction]: Checked pairs total: 339 [2021-03-25 14:52:06,335 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:52:06,335 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1174 [2021-03-25 14:52:06,336 INFO L480 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 42 flow [2021-03-25 14:52:06,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 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:52:06,337 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:06,337 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:06,337 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:52:06,337 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:06,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:06,337 INFO L82 PathProgramCache]: Analyzing trace with hash 942494911, now seen corresponding path program 1 times [2021-03-25 14:52:06,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:06,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026482026] [2021-03-25 14:52:06,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:06,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:06,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:52:06,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:06,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:52:06,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:06,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:52:06,408 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:52:06,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026482026] [2021-03-25 14:52:06,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:06,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:52:06,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931369308] [2021-03-25 14:52:06,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:52:06,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:06,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:52:06,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:52:06,411 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 144 [2021-03-25 14:52:06,412 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 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:52:06,412 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:06,412 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 144 [2021-03-25 14:52:06,412 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:06,443 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-25 14:52:06,443 INFO L130 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2021-03-25 14:52:06,444 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 22 events. 0/22 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 3/25 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-25 14:52:06,444 INFO L132 encePairwiseOnDemand]: 140/144 looper letters, 1 selfloop transitions, 3 changer transitions 1/16 dead transitions. [2021-03-25 14:52:06,444 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 16 transitions, 57 flow [2021-03-25 14:52:06,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:52:06,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:52:06,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2021-03-25 14:52:06,447 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8246527777777778 [2021-03-25 14:52:06,447 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 475 transitions. [2021-03-25 14:52:06,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 475 transitions. [2021-03-25 14:52:06,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:06,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 475 transitions. [2021-03-25 14:52:06,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 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:52:06,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 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:52:06,450 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 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:52:06,450 INFO L185 Difference]: Start difference. First operand has 23 places, 15 transitions, 42 flow. Second operand 4 states and 475 transitions. [2021-03-25 14:52:06,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 16 transitions, 57 flow [2021-03-25 14:52:06,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 16 transitions, 51 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:52:06,451 INFO L241 Difference]: Finished difference. Result has 26 places, 15 transitions, 52 flow [2021-03-25 14:52:06,451 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=52, PETRI_PLACES=26, PETRI_TRANSITIONS=15} [2021-03-25 14:52:06,452 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -9 predicate places. [2021-03-25 14:52:06,452 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:06,452 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 15 transitions, 52 flow [2021-03-25 14:52:06,452 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 15 transitions, 52 flow [2021-03-25 14:52:06,453 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 15 transitions, 52 flow [2021-03-25 14:52:06,455 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-03-25 14:52:06,455 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-25 14:52:06,455 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 15 events. 0/15 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 14 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:52:06,456 INFO L142 LiptonReduction]: Number of co-enabled transitions 74 [2021-03-25 14:52:06,757 INFO L154 LiptonReduction]: Checked pairs total: 148 [2021-03-25 14:52:06,757 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:52:06,757 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 305 [2021-03-25 14:52:06,758 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 14 transitions, 50 flow [2021-03-25 14:52:06,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 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:52:06,758 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:06,758 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:06,759 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:52:06,759 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:06,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:06,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1529641860, now seen corresponding path program 1 times [2021-03-25 14:52:06,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:06,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643518308] [2021-03-25 14:52:06,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:06,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:06,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:52:06,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:06,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:52:06,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:06,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:52:06,900 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:52:06,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643518308] [2021-03-25 14:52:06,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:06,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:52:06,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770814945] [2021-03-25 14:52:06,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:52:06,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:06,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:52:06,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:52:06,904 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 145 [2021-03-25 14:52:06,905 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 14 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 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:52:06,905 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:06,905 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 145 [2021-03-25 14:52:06,905 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:06,982 INFO L129 PetriNetUnfolder]: 15/46 cut-off events. [2021-03-25 14:52:06,984 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-03-25 14:52:06,985 INFO L84 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 46 events. 15/46 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 118 event pairs, 3 based on Foata normal form. 1/47 useless extension candidates. Maximal degree in co-relation 104. Up to 30 conditions per place. [2021-03-25 14:52:06,986 INFO L132 encePairwiseOnDemand]: 140/145 looper letters, 7 selfloop transitions, 4 changer transitions 0/18 dead transitions. [2021-03-25 14:52:06,986 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 18 transitions, 80 flow [2021-03-25 14:52:06,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:52:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:52:06,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 428 transitions. [2021-03-25 14:52:06,990 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7379310344827587 [2021-03-25 14:52:06,990 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 428 transitions. [2021-03-25 14:52:06,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 428 transitions. [2021-03-25 14:52:06,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:06,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 428 transitions. [2021-03-25 14:52:06,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 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:52:06,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 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:52:06,997 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 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:52:06,997 INFO L185 Difference]: Start difference. First operand has 25 places, 14 transitions, 50 flow. Second operand 4 states and 428 transitions. [2021-03-25 14:52:06,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 18 transitions, 80 flow [2021-03-25 14:52:06,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 18 transitions, 68 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-25 14:52:06,998 INFO L241 Difference]: Finished difference. Result has 25 places, 16 transitions, 59 flow [2021-03-25 14:52:06,998 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=59, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2021-03-25 14:52:06,999 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -10 predicate places. [2021-03-25 14:52:06,999 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:06,999 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 16 transitions, 59 flow [2021-03-25 14:52:06,999 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 16 transitions, 59 flow [2021-03-25 14:52:06,999 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 25 places, 16 transitions, 59 flow [2021-03-25 14:52:07,003 INFO L129 PetriNetUnfolder]: 3/21 cut-off events. [2021-03-25 14:52:07,003 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-25 14:52:07,003 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 21 events. 3/21 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 35 event pairs, 1 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 38. Up to 10 conditions per place. [2021-03-25 14:52:07,004 INFO L142 LiptonReduction]: Number of co-enabled transitions 68 [2021-03-25 14:52:07,040 INFO L154 LiptonReduction]: Checked pairs total: 116 [2021-03-25 14:52:07,040 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:52:07,040 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 41 [2021-03-25 14:52:07,045 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 61 flow [2021-03-25 14:52:07,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 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:52:07,046 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:07,046 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:07,046 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:52:07,046 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:07,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:07,046 INFO L82 PathProgramCache]: Analyzing trace with hash 2037445189, now seen corresponding path program 1 times [2021-03-25 14:52:07,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:07,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606653178] [2021-03-25 14:52:07,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:07,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:07,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:07,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:07,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:07,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:07,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:52:07,160 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:52:07,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606653178] [2021-03-25 14:52:07,160 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:07,160 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:52:07,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570627747] [2021-03-25 14:52:07,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:52:07,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:07,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:52:07,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:52:07,165 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 146 [2021-03-25 14:52:07,166 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 61 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 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:52:07,166 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:07,166 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 146 [2021-03-25 14:52:07,166 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:07,190 INFO L129 PetriNetUnfolder]: 9/41 cut-off events. [2021-03-25 14:52:07,190 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-25 14:52:07,191 INFO L84 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 41 events. 9/41 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 109 event pairs, 3 based on Foata normal form. 5/45 useless extension candidates. Maximal degree in co-relation 85. Up to 19 conditions per place. [2021-03-25 14:52:07,191 INFO L132 encePairwiseOnDemand]: 141/146 looper letters, 4 selfloop transitions, 5 changer transitions 3/23 dead transitions. [2021-03-25 14:52:07,191 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 23 transitions, 99 flow [2021-03-25 14:52:07,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:52:07,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:52:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2021-03-25 14:52:07,193 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8068493150684931 [2021-03-25 14:52:07,193 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 589 transitions. [2021-03-25 14:52:07,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 589 transitions. [2021-03-25 14:52:07,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:07,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 589 transitions. [2021-03-25 14:52:07,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 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:52:07,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 146.0) internal successors, (876), 6 states have internal predecessors, (876), 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:52:07,197 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 146.0) internal successors, (876), 6 states have internal predecessors, (876), 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:52:07,198 INFO L185 Difference]: Start difference. First operand has 25 places, 16 transitions, 61 flow. Second operand 5 states and 589 transitions. [2021-03-25 14:52:07,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 23 transitions, 99 flow [2021-03-25 14:52:07,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:52:07,199 INFO L241 Difference]: Finished difference. Result has 30 places, 20 transitions, 93 flow [2021-03-25 14:52:07,199 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2021-03-25 14:52:07,199 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2021-03-25 14:52:07,199 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:07,199 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 20 transitions, 93 flow [2021-03-25 14:52:07,200 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 20 transitions, 93 flow [2021-03-25 14:52:07,200 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 20 transitions, 93 flow [2021-03-25 14:52:07,205 INFO L129 PetriNetUnfolder]: 5/36 cut-off events. [2021-03-25 14:52:07,205 INFO L130 PetriNetUnfolder]: For 16/17 co-relation queries the response was YES. [2021-03-25 14:52:07,206 INFO L84 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 36 events. 5/36 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 101 event pairs, 2 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 87. Up to 12 conditions per place. [2021-03-25 14:52:07,206 INFO L142 LiptonReduction]: Number of co-enabled transitions 70 [2021-03-25 14:52:07,350 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 63 [2021-03-25 14:52:07,595 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 82 [2021-03-25 14:52:07,661 INFO L154 LiptonReduction]: Checked pairs total: 46 [2021-03-25 14:52:07,661 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:52:07,661 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 462 [2021-03-25 14:52:07,662 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 94 flow [2021-03-25 14:52:07,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 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:52:07,662 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:07,662 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:07,663 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:52:07,663 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:07,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:07,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1135565792, now seen corresponding path program 1 times [2021-03-25 14:52:07,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:07,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879294481] [2021-03-25 14:52:07,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:07,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:07,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:07,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:07,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:07,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:07,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:07,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:07,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:52:07,731 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:52:07,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879294481] [2021-03-25 14:52:07,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:07,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:52:07,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515981691] [2021-03-25 14:52:07,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:52:07,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:07,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:52:07,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:52:07,735 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 147 [2021-03-25 14:52:07,736 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 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:52:07,736 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:07,736 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 147 [2021-03-25 14:52:07,736 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:07,787 INFO L129 PetriNetUnfolder]: 3/29 cut-off events. [2021-03-25 14:52:07,787 INFO L130 PetriNetUnfolder]: For 28/53 co-relation queries the response was YES. [2021-03-25 14:52:07,789 INFO L84 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 29 events. 3/29 cut-off events. For 28/53 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 58 event pairs, 0 based on Foata normal form. 14/40 useless extension candidates. Maximal degree in co-relation 80. Up to 12 conditions per place. [2021-03-25 14:52:07,789 INFO L132 encePairwiseOnDemand]: 142/147 looper letters, 2 selfloop transitions, 7 changer transitions 3/23 dead transitions. [2021-03-25 14:52:07,789 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 23 transitions, 132 flow [2021-03-25 14:52:07,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:52:07,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:52:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 826 transitions. [2021-03-25 14:52:07,793 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8027210884353742 [2021-03-25 14:52:07,793 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 826 transitions. [2021-03-25 14:52:07,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 826 transitions. [2021-03-25 14:52:07,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:07,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 826 transitions. [2021-03-25 14:52:07,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.0) internal successors, (826), 7 states have internal predecessors, (826), 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:52:07,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 147.0) internal successors, (1176), 8 states have internal predecessors, (1176), 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:52:07,800 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 147.0) internal successors, (1176), 8 states have internal predecessors, (1176), 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:52:07,800 INFO L185 Difference]: Start difference. First operand has 30 places, 20 transitions, 94 flow. Second operand 7 states and 826 transitions. [2021-03-25 14:52:07,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 23 transitions, 132 flow [2021-03-25 14:52:07,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 23 transitions, 123 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-25 14:52:07,803 INFO L241 Difference]: Finished difference. Result has 38 places, 20 transitions, 109 flow [2021-03-25 14:52:07,803 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=109, PETRI_PLACES=38, PETRI_TRANSITIONS=20} [2021-03-25 14:52:07,803 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2021-03-25 14:52:07,803 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:07,803 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 20 transitions, 109 flow [2021-03-25 14:52:07,803 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 20 transitions, 109 flow [2021-03-25 14:52:07,804 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 20 transitions, 109 flow [2021-03-25 14:52:07,809 INFO L129 PetriNetUnfolder]: 2/25 cut-off events. [2021-03-25 14:52:07,809 INFO L130 PetriNetUnfolder]: For 29/34 co-relation queries the response was YES. [2021-03-25 14:52:07,809 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 25 events. 2/25 cut-off events. For 29/34 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 35 event pairs, 0 based on Foata normal form. 1/25 useless extension candidates. Maximal degree in co-relation 65. Up to 10 conditions per place. [2021-03-25 14:52:07,810 INFO L142 LiptonReduction]: Number of co-enabled transitions 44 [2021-03-25 14:52:08,123 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:52:08,247 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:52:09,005 WARN L205 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 189 [2021-03-25 14:52:09,245 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2021-03-25 14:52:10,624 WARN L205 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 343 DAG size of output: 265 [2021-03-25 14:52:11,124 WARN L205 SmtUtils]: Spent 497.00 ms on a formula simplification that was a NOOP. DAG size: 247 [2021-03-25 14:52:11,128 INFO L154 LiptonReduction]: Checked pairs total: 30 [2021-03-25 14:52:11,128 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 14:52:11,128 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3325 [2021-03-25 14:52:11,129 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 15 transitions, 87 flow [2021-03-25 14:52:11,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 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:52:11,129 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:11,129 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:11,130 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:52:11,130 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:11,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:11,130 INFO L82 PathProgramCache]: Analyzing trace with hash -92889922, now seen corresponding path program 1 times [2021-03-25 14:52:11,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:11,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865786876] [2021-03-25 14:52:11,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:11,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:11,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:52:11,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:11,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 14:52:11,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:11,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 14:52:11,234 INFO L142 QuantifierPusher]: treesize reduction 26, result has 65.3 percent of original size [2021-03-25 14:52:11,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 14:52:11,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:11,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 14:52:11,286 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:52:11,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865786876] [2021-03-25 14:52:11,286 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:11,287 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:52:11,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623033698] [2021-03-25 14:52:11,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:52:11,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:11,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:52:11,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:52:11,288 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 150 [2021-03-25 14:52:11,289 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 15 transitions, 87 flow. Second operand has 7 states, 7 states have (on average 102.85714285714286) internal successors, (720), 7 states have internal predecessors, (720), 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:52:11,289 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:11,289 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 150 [2021-03-25 14:52:11,289 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:11,346 INFO L129 PetriNetUnfolder]: 3/23 cut-off events. [2021-03-25 14:52:11,347 INFO L130 PetriNetUnfolder]: For 110/124 co-relation queries the response was YES. [2021-03-25 14:52:11,347 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 23 events. 3/23 cut-off events. For 110/124 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 1 based on Foata normal form. 11/34 useless extension candidates. Maximal degree in co-relation 75. Up to 9 conditions per place. [2021-03-25 14:52:11,347 INFO L132 encePairwiseOnDemand]: 145/150 looper letters, 4 selfloop transitions, 2 changer transitions 3/16 dead transitions. [2021-03-25 14:52:11,347 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 16 transitions, 107 flow [2021-03-25 14:52:11,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:52:11,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:52:11,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 520 transitions. [2021-03-25 14:52:11,350 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6933333333333334 [2021-03-25 14:52:11,350 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 520 transitions. [2021-03-25 14:52:11,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 520 transitions. [2021-03-25 14:52:11,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:11,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 520 transitions. [2021-03-25 14:52:11,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.0) internal successors, (520), 5 states have internal predecessors, (520), 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:52:11,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 150.0) internal successors, (900), 6 states have internal predecessors, (900), 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:52:11,353 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 150.0) internal successors, (900), 6 states have internal predecessors, (900), 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:52:11,353 INFO L185 Difference]: Start difference. First operand has 30 places, 15 transitions, 87 flow. Second operand 5 states and 520 transitions. [2021-03-25 14:52:11,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 16 transitions, 107 flow [2021-03-25 14:52:11,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 16 transitions, 84 flow, removed 7 selfloop flow, removed 7 redundant places. [2021-03-25 14:52:11,355 INFO L241 Difference]: Finished difference. Result has 28 places, 13 transitions, 62 flow [2021-03-25 14:52:11,355 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=150, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=62, PETRI_PLACES=28, PETRI_TRANSITIONS=13} [2021-03-25 14:52:11,355 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -7 predicate places. [2021-03-25 14:52:11,355 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:11,355 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 13 transitions, 62 flow [2021-03-25 14:52:11,355 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 13 transitions, 62 flow [2021-03-25 14:52:11,356 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 13 transitions, 62 flow [2021-03-25 14:52:11,358 INFO L129 PetriNetUnfolder]: 1/13 cut-off events. [2021-03-25 14:52:11,358 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2021-03-25 14:52:11,358 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 13 events. 1/13 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 6 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 29. Up to 4 conditions per place. [2021-03-25 14:52:11,358 INFO L142 LiptonReduction]: Number of co-enabled transitions 10 [2021-03-25 14:52:11,359 INFO L154 LiptonReduction]: Checked pairs total: 8 [2021-03-25 14:52:11,359 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:52:11,359 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4 [2021-03-25 14:52:11,360 INFO L480 AbstractCegarLoop]: Abstraction has has 26 places, 13 transitions, 62 flow [2021-03-25 14:52:11,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 102.85714285714286) internal successors, (720), 7 states have internal predecessors, (720), 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:52:11,360 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:11,360 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:11,361 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:52:11,361 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:11,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:11,361 INFO L82 PathProgramCache]: Analyzing trace with hash 403841135, now seen corresponding path program 1 times [2021-03-25 14:52:11,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:11,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96824184] [2021-03-25 14:52:11,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:52:11,411 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:52:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:52:11,454 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:52:11,494 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:52:11,494 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:52:11,495 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:52:11,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:52:11 BasicIcfg [2021-03-25 14:52:11,551 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:52:11,552 INFO L168 Benchmark]: Toolchain (without parser) took 19689.70 ms. Allocated memory was 255.9 MB in the beginning and 625.0 MB in the end (delta: 369.1 MB). Free memory was 232.9 MB in the beginning and 505.2 MB in the end (delta: -272.3 MB). Peak memory consumption was 95.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:52:11,552 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 255.9 MB. Free memory was 237.8 MB in the beginning and 237.7 MB in the end (delta: 160.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:52:11,553 INFO L168 Benchmark]: CACSL2BoogieTranslator took 428.68 ms. Allocated memory was 255.9 MB in the beginning and 333.4 MB in the end (delta: 77.6 MB). Free memory was 232.3 MB in the beginning and 293.1 MB in the end (delta: -60.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-25 14:52:11,553 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.92 ms. Allocated memory is still 333.4 MB. Free memory was 293.1 MB in the beginning and 290.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:52:11,553 INFO L168 Benchmark]: Boogie Preprocessor took 42.34 ms. Allocated memory is still 333.4 MB. Free memory was 290.4 MB in the beginning and 288.3 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:52:11,554 INFO L168 Benchmark]: RCFGBuilder took 1617.37 ms. Allocated memory is still 333.4 MB. Free memory was 288.3 MB in the beginning and 226.7 MB in the end (delta: 61.6 MB). Peak memory consumption was 63.8 MB. Max. memory is 16.0 GB. [2021-03-25 14:52:11,554 INFO L168 Benchmark]: TraceAbstraction took 17533.62 ms. Allocated memory was 333.4 MB in the beginning and 625.0 MB in the end (delta: 291.5 MB). Free memory was 225.8 MB in the beginning and 505.2 MB in the end (delta: -279.4 MB). Peak memory consumption was 12.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:52:11,561 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.13 ms. Allocated memory is still 255.9 MB. Free memory was 237.8 MB in the beginning and 237.7 MB in the end (delta: 160.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 428.68 ms. Allocated memory was 255.9 MB in the beginning and 333.4 MB in the end (delta: 77.6 MB). Free memory was 232.3 MB in the beginning and 293.1 MB in the end (delta: -60.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 44.92 ms. Allocated memory is still 333.4 MB. Free memory was 293.1 MB in the beginning and 290.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 42.34 ms. Allocated memory is still 333.4 MB. Free memory was 290.4 MB in the beginning and 288.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1617.37 ms. Allocated memory is still 333.4 MB. Free memory was 288.3 MB in the beginning and 226.7 MB in the end (delta: 61.6 MB). Peak memory consumption was 63.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 17533.62 ms. Allocated memory was 333.4 MB in the beginning and 625.0 MB in the end (delta: 291.5 MB). Free memory was 225.8 MB in the beginning and 505.2 MB in the end (delta: -279.4 MB). Peak memory consumption was 12.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7592.4ms, 83 PlacesBefore, 35 PlacesAfterwards, 78 TransitionsBefore, 29 TransitionsAfterwards, 926 CoEnabledTransitionPairs, 4 FixpointIterations, 27 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 57 TotalNumberOfCompositions, 1464 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 774, positive: 727, positive conditional: 0, positive unconditional: 727, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 584, positive: 561, positive conditional: 0, positive unconditional: 561, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 584, positive: 561, positive conditional: 0, positive unconditional: 561, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 584, positive: 558, positive conditional: 0, positive unconditional: 558, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 26, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 325, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 316, negative conditional: 0, negative unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 774, positive: 166, positive conditional: 0, positive unconditional: 166, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 584, unknown conditional: 0, unknown unconditional: 584] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2817.2ms, 33 PlacesBefore, 24 PlacesAfterwards, 22 TransitionsBefore, 17 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 408 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 143, positive: 97, positive conditional: 0, positive unconditional: 97, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 34, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 34, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 171, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 171, negative conditional: 0, negative unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 143, positive: 75, positive conditional: 0, positive unconditional: 75, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 34, unknown conditional: 0, unknown unconditional: 34] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 53, Positive conditional cache size: 0, Positive unconditional cache size: 53, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1172.8ms, 25 PlacesBefore, 23 PlacesAfterwards, 17 TransitionsBefore, 15 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 339 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 119, positive: 77, positive conditional: 0, positive unconditional: 77, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 9, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 9, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 119, positive: 68, positive conditional: 0, positive unconditional: 68, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 304.6ms, 26 PlacesBefore, 25 PlacesAfterwards, 15 TransitionsBefore, 14 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 148 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 46, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 203, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 203, negative conditional: 0, negative unconditional: 203, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 61, Positive cache size: 41, Positive conditional cache size: 0, Positive unconditional cache size: 41, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 40.9ms, 25 PlacesBefore, 25 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 68 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 116 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 36, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 2, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 2, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 36, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 56, Positive cache size: 41, Positive conditional cache size: 0, Positive unconditional cache size: 41, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 461.5ms, 30 PlacesBefore, 30 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 46 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 10, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 35, Positive conditional cache size: 0, Positive unconditional cache size: 35, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3324.5ms, 38 PlacesBefore, 30 PlacesAfterwards, 20 TransitionsBefore, 15 TransitionsAfterwards, 44 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 30 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 22, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 50, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 16, Positive conditional cache size: 0, Positive unconditional cache size: 16, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8ms, 28 PlacesBefore, 26 PlacesAfterwards, 13 TransitionsBefore, 13 TransitionsAfterwards, 10 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 8 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 6, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t2011; [L793] FCALL, FORK 0 pthread_create(&t2011, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 [L747] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] 0 pthread_t t2012; [L795] FCALL, FORK 0 pthread_create(&t2012, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 __unbuffered_p1_EAX = x [L767] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L774] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L805] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L813] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L813] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L814] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L814] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L815] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L815] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L816] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L817] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L817] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L818] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.1ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 17376.0ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 459.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7652.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 25 SDtfs, 6 SDslu, 11 SDs, 0 SdLazy, 104 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 133.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 168.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=6, InterpolantAutomatonStates: 31, 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: 23.1ms SsaConstructionTime, 312.2ms SatisfiabilityAnalysisTime, 545.5ms InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 69 ConstructedInterpolants, 0 QuantifiedInterpolants, 485 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...