/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 09:57:09,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 09:57:09,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 09:57:09,991 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 09:57:09,991 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 09:57:09,992 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 09:57:09,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 09:57:09,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 09:57:09,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 09:57:09,998 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 09:57:09,999 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 09:57:10,000 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 09:57:10,000 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 09:57:10,001 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 09:57:10,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 09:57:10,003 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 09:57:10,004 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 09:57:10,005 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 09:57:10,006 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 09:57:10,008 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 09:57:10,009 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 09:57:10,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 09:57:10,011 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 09:57:10,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 09:57:10,014 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 09:57:10,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 09:57:10,015 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 09:57:10,015 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 09:57:10,016 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 09:57:10,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 09:57:10,017 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 09:57:10,017 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 09:57:10,018 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 09:57:10,019 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 09:57:10,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 09:57:10,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 09:57:10,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 09:57:10,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 09:57:10,021 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 09:57:10,022 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 09:57:10,023 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 09:57:10,024 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 09:57:10,043 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 09:57:10,044 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 09:57:10,045 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 09:57:10,045 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 09:57:10,045 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 09:57:10,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 09:57:10,046 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 09:57:10,046 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 09:57:10,046 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 09:57:10,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 09:57:10,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 09:57:10,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 09:57:10,047 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 09:57:10,047 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 09:57:10,047 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 09:57:10,047 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 09:57:10,047 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 09:57:10,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 09:57:10,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 09:57:10,048 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 09:57:10,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 09:57:10,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 09:57:10,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 09:57:10,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 09:57:10,049 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 09:57:10,049 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 09:57:10,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 09:57:10,049 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 09:57:10,049 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 09:57:10,050 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 09:57:10,050 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-26 09:57:10,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 09:57:10,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 09:57:10,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 09:57:10,370 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 09:57:10,371 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 09:57:10,372 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_power.opt.i [2021-03-26 09:57:10,424 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c67ce72be/d5aaa6b9f3b64e40a92dc96ebed5622f/FLAGd11e03b72 [2021-03-26 09:57:10,946 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 09:57:10,951 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_power.opt.i [2021-03-26 09:57:10,976 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c67ce72be/d5aaa6b9f3b64e40a92dc96ebed5622f/FLAGd11e03b72 [2021-03-26 09:57:11,274 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c67ce72be/d5aaa6b9f3b64e40a92dc96ebed5622f [2021-03-26 09:57:11,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 09:57:11,278 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 09:57:11,278 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 09:57:11,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 09:57:11,288 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 09:57:11,289 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 09:57:11" (1/1) ... [2021-03-26 09:57:11,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@735b92e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:57:11, skipping insertion in model container [2021-03-26 09:57:11,289 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 09:57:11" (1/1) ... [2021-03-26 09:57:11,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 09:57:11,355 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 09:57:11,467 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/mix017_power.opt.i[950,963] [2021-03-26 09:57:11,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 09:57:11,661 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 09:57:11,670 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/mix017_power.opt.i[950,963] [2021-03-26 09:57:11,743 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 09:57:11,812 INFO L208 MainTranslator]: Completed translation [2021-03-26 09:57:11,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:57:11 WrapperNode [2021-03-26 09:57:11,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 09:57:11,813 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 09:57:11,813 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 09:57:11,814 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 09:57:11,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:57:11" (1/1) ... [2021-03-26 09:57:11,833 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:57:11" (1/1) ... [2021-03-26 09:57:11,862 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 09:57:11,863 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 09:57:11,863 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 09:57:11,863 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 09:57:11,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:57:11" (1/1) ... [2021-03-26 09:57:11,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:57:11" (1/1) ... [2021-03-26 09:57:11,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:57:11" (1/1) ... [2021-03-26 09:57:11,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:57:11" (1/1) ... [2021-03-26 09:57:11,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:57:11" (1/1) ... [2021-03-26 09:57:11,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:57:11" (1/1) ... [2021-03-26 09:57:11,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:57:11" (1/1) ... [2021-03-26 09:57:11,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 09:57:11,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 09:57:11,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 09:57:11,897 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 09:57:11,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:57:11" (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-26 09:57:11,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 09:57:11,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 09:57:11,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 09:57:11,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 09:57:11,956 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 09:57:11,956 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 09:57:11,956 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 09:57:11,956 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 09:57:11,956 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 09:57:11,956 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 09:57:11,956 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 09:57:11,956 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 09:57:11,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 09:57:11,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 09:57:11,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 09:57:11,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 09:57:11,958 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 09:57:13,515 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 09:57:13,515 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 09:57:13,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 09:57:13 BoogieIcfgContainer [2021-03-26 09:57:13,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 09:57:13,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 09:57:13,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 09:57:13,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 09:57:13,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 09:57:11" (1/3) ... [2021-03-26 09:57:13,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f651db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 09:57:13, skipping insertion in model container [2021-03-26 09:57:13,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 09:57:11" (2/3) ... [2021-03-26 09:57:13,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f651db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 09:57:13, skipping insertion in model container [2021-03-26 09:57:13,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 09:57:13" (3/3) ... [2021-03-26 09:57:13,523 INFO L111 eAbstractionObserver]: Analyzing ICFG mix017_power.opt.i [2021-03-26 09:57:13,528 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 09:57:13,532 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 09:57:13,533 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 09:57:13,569 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,569 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,569 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,570 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,570 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,570 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,570 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,570 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,570 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,570 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,571 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,571 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,572 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,572 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,572 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,572 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,572 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,573 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,573 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,573 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,575 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,575 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,575 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,575 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,575 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,576 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,576 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,576 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,577 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,577 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,577 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,577 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,577 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,577 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,577 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,577 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,577 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,578 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,578 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,578 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,578 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,578 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,578 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,578 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,578 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,578 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,578 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,578 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,580 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,580 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,580 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,580 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,581 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,582 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,583 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,584 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,585 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,586 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,589 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,592 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,596 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,597 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,597 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,597 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,597 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,597 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,597 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,598 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,598 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,601 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,601 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,601 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,601 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,601 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,601 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,601 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,602 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,602 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,602 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,602 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,602 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,602 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,602 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,602 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,602 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,603 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,603 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,603 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,603 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,603 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,603 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,603 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,603 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,604 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,604 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,604 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,607 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,607 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,607 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,608 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,608 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,608 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,608 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,609 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,610 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,612 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,613 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,613 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,614 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,615 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,615 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,615 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,615 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,615 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,615 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,615 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,615 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,615 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,618 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,618 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 09:57:13,619 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 09:57:13,634 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 09:57:13,664 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 09:57:13,664 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 09:57:13,664 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 09:57:13,664 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 09:57:13,664 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 09:57:13,664 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 09:57:13,665 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 09:57:13,665 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 09:57:13,677 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 254 flow [2021-03-26 09:57:13,728 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-26 09:57:13,728 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:57:13,742 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2021-03-26 09:57:13,742 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 117 transitions, 254 flow [2021-03-26 09:57:13,746 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 113 transitions, 238 flow [2021-03-26 09:57:13,747 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:57:13,763 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-26 09:57:13,767 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-26 09:57:13,771 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 238 flow [2021-03-26 09:57:13,802 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-26 09:57:13,803 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:57:13,804 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2021-03-26 09:57:13,808 INFO L142 LiptonReduction]: Number of co-enabled transitions 2512 [2021-03-26 09:57:15,199 WARN L205 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 09:57:15,601 WARN L205 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-26 09:57:15,723 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 09:57:17,052 INFO L154 LiptonReduction]: Checked pairs total: 4168 [2021-03-26 09:57:17,052 INFO L156 LiptonReduction]: Total number of compositions: 75 [2021-03-26 09:57:17,054 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3308 [2021-03-26 09:57:17,064 INFO L129 PetriNetUnfolder]: 0/25 cut-off events. [2021-03-26 09:57:17,064 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:57:17,064 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:57:17,065 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:57:17,065 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:57:17,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:57:17,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1330076936, now seen corresponding path program 1 times [2021-03-26 09:57:17,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:57:17,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116156478] [2021-03-26 09:57:17,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:57:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:57:17,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:17,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:57:17,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:17,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:17,311 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-26 09:57:17,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116156478] [2021-03-26 09:57:17,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:57:17,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 09:57:17,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347037733] [2021-03-26 09:57:17,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 09:57:17,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:57:17,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 09:57:17,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 09:57:17,332 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 192 [2021-03-26 09:57:17,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 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-26 09:57:17,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:57:17,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 192 [2021-03-26 09:57:17,339 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:57:17,426 INFO L129 PetriNetUnfolder]: 29/148 cut-off events. [2021-03-26 09:57:17,426 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:57:17,427 INFO L84 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 148 events. 29/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 595 event pairs, 15 based on Foata normal form. 9/140 useless extension candidates. Maximal degree in co-relation 193. Up to 41 conditions per place. [2021-03-26 09:57:17,429 INFO L132 encePairwiseOnDemand]: 188/192 looper letters, 7 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2021-03-26 09:57:17,430 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 46 transitions, 122 flow [2021-03-26 09:57:17,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 09:57:17,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 09:57:17,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2021-03-26 09:57:17,450 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9114583333333334 [2021-03-26 09:57:17,450 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2021-03-26 09:57:17,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2021-03-26 09:57:17,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:57:17,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2021-03-26 09:57:17,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 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-26 09:57:17,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 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-26 09:57:17,470 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 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-26 09:57:17,472 INFO L185 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 525 transitions. [2021-03-26 09:57:17,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 46 transitions, 122 flow [2021-03-26 09:57:17,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 46 transitions, 118 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 09:57:17,477 INFO L241 Difference]: Finished difference. Result has 54 places, 43 transitions, 98 flow [2021-03-26 09:57:17,479 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2021-03-26 09:57:17,480 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2021-03-26 09:57:17,480 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:57:17,480 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 43 transitions, 98 flow [2021-03-26 09:57:17,481 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 43 transitions, 98 flow [2021-03-26 09:57:17,482 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 98 flow [2021-03-26 09:57:17,491 INFO L129 PetriNetUnfolder]: 0/43 cut-off events. [2021-03-26 09:57:17,491 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:57:17,491 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 43 events. 0/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 38 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 09:57:17,492 INFO L142 LiptonReduction]: Number of co-enabled transitions 512 [2021-03-26 09:57:17,970 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 09:57:18,089 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 09:57:19,445 INFO L154 LiptonReduction]: Checked pairs total: 2080 [2021-03-26 09:57:19,445 INFO L156 LiptonReduction]: Total number of compositions: 14 [2021-03-26 09:57:19,445 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1965 [2021-03-26 09:57:19,447 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2021-03-26 09:57:19,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 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-26 09:57:19,447 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:57:19,447 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:57:19,447 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 09:57:19,448 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:57:19,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:57:19,448 INFO L82 PathProgramCache]: Analyzing trace with hash -855823093, now seen corresponding path program 1 times [2021-03-26 09:57:19,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:57:19,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513185712] [2021-03-26 09:57:19,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:57:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:57:19,568 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:19,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:57:19,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:19,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:19,577 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 09:57:19,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 09:57:19,581 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-26 09:57:19,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513185712] [2021-03-26 09:57:19,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:57:19,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:57:19,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895477386] [2021-03-26 09:57:19,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:57:19,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:57:19,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:57:19,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:57:19,584 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 206 [2021-03-26 09:57:19,585 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 181.75) internal successors, (727), 4 states have internal predecessors, (727), 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-26 09:57:19,585 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:57:19,585 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 206 [2021-03-26 09:57:19,585 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:57:19,608 INFO L129 PetriNetUnfolder]: 1/31 cut-off events. [2021-03-26 09:57:19,609 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:57:19,609 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 31 events. 1/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 39. Up to 3 conditions per place. [2021-03-26 09:57:19,609 INFO L132 encePairwiseOnDemand]: 202/206 looper letters, 1 selfloop transitions, 2 changer transitions 3/31 dead transitions. [2021-03-26 09:57:19,609 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 31 transitions, 86 flow [2021-03-26 09:57:19,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 09:57:19,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 09:57:19,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 912 transitions. [2021-03-26 09:57:19,613 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8854368932038835 [2021-03-26 09:57:19,613 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 912 transitions. [2021-03-26 09:57:19,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 912 transitions. [2021-03-26 09:57:19,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:57:19,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 912 transitions. [2021-03-26 09:57:19,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 182.4) internal successors, (912), 5 states have internal predecessors, (912), 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-26 09:57:19,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 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-26 09:57:19,618 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 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-26 09:57:19,619 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 5 states and 912 transitions. [2021-03-26 09:57:19,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 31 transitions, 86 flow [2021-03-26 09:57:19,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 31 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 09:57:19,620 INFO L241 Difference]: Finished difference. Result has 43 places, 28 transitions, 72 flow [2021-03-26 09:57:19,620 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2021-03-26 09:57:19,625 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -15 predicate places. [2021-03-26 09:57:19,625 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:57:19,625 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 28 transitions, 72 flow [2021-03-26 09:57:19,626 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 28 transitions, 72 flow [2021-03-26 09:57:19,626 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 28 transitions, 72 flow [2021-03-26 09:57:19,636 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-03-26 09:57:19,636 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:57:19,636 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 09:57:19,637 INFO L142 LiptonReduction]: Number of co-enabled transitions 328 [2021-03-26 09:57:20,324 WARN L205 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-26 09:57:20,550 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-26 09:57:20,945 WARN L205 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-26 09:57:21,125 WARN L205 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-26 09:57:21,135 INFO L154 LiptonReduction]: Checked pairs total: 1088 [2021-03-26 09:57:21,135 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 09:57:21,135 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1510 [2021-03-26 09:57:21,137 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 66 flow [2021-03-26 09:57:21,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 181.75) internal successors, (727), 4 states have internal predecessors, (727), 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-26 09:57:21,137 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:57:21,137 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:57:21,138 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 09:57:21,138 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:57:21,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:57:21,138 INFO L82 PathProgramCache]: Analyzing trace with hash 249399682, now seen corresponding path program 1 times [2021-03-26 09:57:21,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:57:21,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549574467] [2021-03-26 09:57:21,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:57:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:57:21,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:21,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:21,249 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 09:57:21,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 09:57:21,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:21,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:57:21,257 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-26 09:57:21,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549574467] [2021-03-26 09:57:21,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:57:21,257 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:57:21,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686834698] [2021-03-26 09:57:21,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:57:21,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:57:21,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:57:21,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:57:21,260 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 209 [2021-03-26 09:57:21,261 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 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-26 09:57:21,261 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:57:21,261 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 209 [2021-03-26 09:57:21,261 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:57:21,323 INFO L129 PetriNetUnfolder]: 90/184 cut-off events. [2021-03-26 09:57:21,324 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 09:57:21,325 INFO L84 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 184 events. 90/184 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 808 event pairs, 46 based on Foata normal form. 16/195 useless extension candidates. Maximal degree in co-relation 356. Up to 119 conditions per place. [2021-03-26 09:57:21,326 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 6 selfloop transitions, 5 changer transitions 9/38 dead transitions. [2021-03-26 09:57:21,326 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 38 transitions, 132 flow [2021-03-26 09:57:21,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 09:57:21,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 09:57:21,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 902 transitions. [2021-03-26 09:57:21,328 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8631578947368421 [2021-03-26 09:57:21,329 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 902 transitions. [2021-03-26 09:57:21,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 902 transitions. [2021-03-26 09:57:21,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:57:21,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 902 transitions. [2021-03-26 09:57:21,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 180.4) internal successors, (902), 5 states have internal predecessors, (902), 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-26 09:57:21,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 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-26 09:57:21,334 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 209.0) internal successors, (1254), 6 states have internal predecessors, (1254), 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-26 09:57:21,334 INFO L185 Difference]: Start difference. First operand has 37 places, 25 transitions, 66 flow. Second operand 5 states and 902 transitions. [2021-03-26 09:57:21,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 38 transitions, 132 flow [2021-03-26 09:57:21,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 38 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 09:57:21,335 INFO L241 Difference]: Finished difference. Result has 42 places, 29 transitions, 107 flow [2021-03-26 09:57:21,336 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2021-03-26 09:57:21,336 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -16 predicate places. [2021-03-26 09:57:21,336 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:57:21,336 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 29 transitions, 107 flow [2021-03-26 09:57:21,336 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 29 transitions, 107 flow [2021-03-26 09:57:21,337 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 107 flow [2021-03-26 09:57:21,349 INFO L129 PetriNetUnfolder]: 73/145 cut-off events. [2021-03-26 09:57:21,349 INFO L130 PetriNetUnfolder]: For 72/76 co-relation queries the response was YES. [2021-03-26 09:57:21,350 INFO L84 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 145 events. 73/145 cut-off events. For 72/76 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 524 event pairs, 40 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 380. Up to 104 conditions per place. [2021-03-26 09:57:21,352 INFO L142 LiptonReduction]: Number of co-enabled transitions 356 [2021-03-26 09:57:21,444 INFO L154 LiptonReduction]: Checked pairs total: 307 [2021-03-26 09:57:21,444 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:57:21,444 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 108 [2021-03-26 09:57:21,445 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 107 flow [2021-03-26 09:57:21,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 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-26 09:57:21,446 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:57:21,446 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:57:21,446 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 09:57:21,446 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:57:21,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:57:21,446 INFO L82 PathProgramCache]: Analyzing trace with hash 136724570, now seen corresponding path program 1 times [2021-03-26 09:57:21,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:57:21,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139300701] [2021-03-26 09:57:21,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:57:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:57:21,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:21,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:21,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:21,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:21,551 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 09:57:21,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 09:57:21,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:21,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:57:21,561 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-26 09:57:21,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139300701] [2021-03-26 09:57:21,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:57:21,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 09:57:21,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452260788] [2021-03-26 09:57:21,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 09:57:21,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:57:21,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 09:57:21,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 09:57:21,563 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 209 [2021-03-26 09:57:21,565 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 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-26 09:57:21,565 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:57:21,565 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 209 [2021-03-26 09:57:21,565 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:57:21,643 INFO L129 PetriNetUnfolder]: 66/147 cut-off events. [2021-03-26 09:57:21,644 INFO L130 PetriNetUnfolder]: For 105/142 co-relation queries the response was YES. [2021-03-26 09:57:21,645 INFO L84 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 147 events. 66/147 cut-off events. For 105/142 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 557 event pairs, 14 based on Foata normal form. 23/166 useless extension candidates. Maximal degree in co-relation 502. Up to 108 conditions per place. [2021-03-26 09:57:21,646 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 6 selfloop transitions, 9 changer transitions 9/42 dead transitions. [2021-03-26 09:57:21,647 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 42 transitions, 231 flow [2021-03-26 09:57:21,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 09:57:21,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 09:57:21,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1082 transitions. [2021-03-26 09:57:21,649 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8628389154704944 [2021-03-26 09:57:21,651 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1082 transitions. [2021-03-26 09:57:21,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1082 transitions. [2021-03-26 09:57:21,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:57:21,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1082 transitions. [2021-03-26 09:57:21,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 180.33333333333334) internal successors, (1082), 6 states have internal predecessors, (1082), 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-26 09:57:21,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 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-26 09:57:21,657 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 209.0) internal successors, (1463), 7 states have internal predecessors, (1463), 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-26 09:57:21,657 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 107 flow. Second operand 6 states and 1082 transitions. [2021-03-26 09:57:21,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 42 transitions, 231 flow [2021-03-26 09:57:21,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 42 transitions, 224 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 09:57:21,661 INFO L241 Difference]: Finished difference. Result has 46 places, 33 transitions, 172 flow [2021-03-26 09:57:21,661 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2021-03-26 09:57:21,661 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -12 predicate places. [2021-03-26 09:57:21,661 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:57:21,661 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 33 transitions, 172 flow [2021-03-26 09:57:21,662 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 33 transitions, 172 flow [2021-03-26 09:57:21,662 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 33 transitions, 172 flow [2021-03-26 09:57:21,678 INFO L129 PetriNetUnfolder]: 49/115 cut-off events. [2021-03-26 09:57:21,678 INFO L130 PetriNetUnfolder]: For 182/213 co-relation queries the response was YES. [2021-03-26 09:57:21,679 INFO L84 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 115 events. 49/115 cut-off events. For 182/213 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 406 event pairs, 13 based on Foata normal form. 3/115 useless extension candidates. Maximal degree in co-relation 434. Up to 76 conditions per place. [2021-03-26 09:57:21,680 INFO L142 LiptonReduction]: Number of co-enabled transitions 428 [2021-03-26 09:57:21,686 INFO L154 LiptonReduction]: Checked pairs total: 395 [2021-03-26 09:57:21,687 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:57:21,687 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 26 [2021-03-26 09:57:21,691 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 172 flow [2021-03-26 09:57:21,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 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-26 09:57:21,692 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:57:21,692 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:57:21,692 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 09:57:21,692 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:57:21,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:57:21,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1851099711, now seen corresponding path program 1 times [2021-03-26 09:57:21,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:57:21,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176810935] [2021-03-26 09:57:21,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:57:21,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:57:21,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:21,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:21,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:21,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:21,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:21,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:21,833 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 09:57:21,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 09:57:21,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:21,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:57:21,844 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-26 09:57:21,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176810935] [2021-03-26 09:57:21,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:57:21,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 09:57:21,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351051775] [2021-03-26 09:57:21,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 09:57:21,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:57:21,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 09:57:21,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 09:57:21,847 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 209 [2021-03-26 09:57:21,848 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 176.83333333333334) internal successors, (1061), 6 states have internal predecessors, (1061), 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-26 09:57:21,849 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:57:21,849 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 209 [2021-03-26 09:57:21,849 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:57:21,922 INFO L129 PetriNetUnfolder]: 36/95 cut-off events. [2021-03-26 09:57:21,922 INFO L130 PetriNetUnfolder]: For 208/289 co-relation queries the response was YES. [2021-03-26 09:57:21,923 INFO L84 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 95 events. 36/95 cut-off events. For 208/289 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 283 event pairs, 2 based on Foata normal form. 27/119 useless extension candidates. Maximal degree in co-relation 430. Up to 68 conditions per place. [2021-03-26 09:57:21,923 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 6 selfloop transitions, 13 changer transitions 9/46 dead transitions. [2021-03-26 09:57:21,924 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 46 transitions, 354 flow [2021-03-26 09:57:21,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 09:57:21,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 09:57:21,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1262 transitions. [2021-03-26 09:57:21,931 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8626110731373889 [2021-03-26 09:57:21,931 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1262 transitions. [2021-03-26 09:57:21,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1262 transitions. [2021-03-26 09:57:21,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:57:21,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1262 transitions. [2021-03-26 09:57:21,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 180.28571428571428) internal successors, (1262), 7 states have internal predecessors, (1262), 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-26 09:57:21,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 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-26 09:57:21,938 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 209.0) internal successors, (1672), 8 states have internal predecessors, (1672), 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-26 09:57:21,938 INFO L185 Difference]: Start difference. First operand has 44 places, 33 transitions, 172 flow. Second operand 7 states and 1262 transitions. [2021-03-26 09:57:21,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 46 transitions, 354 flow [2021-03-26 09:57:21,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 46 transitions, 292 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-26 09:57:21,943 INFO L241 Difference]: Finished difference. Result has 49 places, 37 transitions, 222 flow [2021-03-26 09:57:21,944 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2021-03-26 09:57:21,944 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -9 predicate places. [2021-03-26 09:57:21,944 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:57:21,944 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 37 transitions, 222 flow [2021-03-26 09:57:21,944 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 37 transitions, 222 flow [2021-03-26 09:57:21,945 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 37 transitions, 222 flow [2021-03-26 09:57:21,958 INFO L129 PetriNetUnfolder]: 25/73 cut-off events. [2021-03-26 09:57:21,958 INFO L130 PetriNetUnfolder]: For 172/195 co-relation queries the response was YES. [2021-03-26 09:57:21,958 INFO L84 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 73 events. 25/73 cut-off events. For 172/195 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 202 event pairs, 2 based on Foata normal form. 4/74 useless extension candidates. Maximal degree in co-relation 269. Up to 42 conditions per place. [2021-03-26 09:57:21,959 INFO L142 LiptonReduction]: Number of co-enabled transitions 428 [2021-03-26 09:57:21,965 INFO L154 LiptonReduction]: Checked pairs total: 422 [2021-03-26 09:57:21,965 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:57:21,965 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21 [2021-03-26 09:57:21,967 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 222 flow [2021-03-26 09:57:21,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 176.83333333333334) internal successors, (1061), 6 states have internal predecessors, (1061), 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-26 09:57:21,968 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:57:21,968 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:57:21,968 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 09:57:21,968 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:57:21,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:57:21,968 INFO L82 PathProgramCache]: Analyzing trace with hash 565894138, now seen corresponding path program 1 times [2021-03-26 09:57:21,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:57:21,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740694434] [2021-03-26 09:57:21,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:57:22,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:57:22,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:22,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:57:22,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:22,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:22,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:22,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:22,061 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-26 09:57:22,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740694434] [2021-03-26 09:57:22,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:57:22,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:57:22,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350425872] [2021-03-26 09:57:22,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:57:22,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:57:22,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:57:22,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:57:22,063 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 209 [2021-03-26 09:57:22,064 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 222 flow. Second operand has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 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-26 09:57:22,064 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:57:22,064 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 209 [2021-03-26 09:57:22,064 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:57:22,094 INFO L129 PetriNetUnfolder]: 50/129 cut-off events. [2021-03-26 09:57:22,095 INFO L130 PetriNetUnfolder]: For 329/360 co-relation queries the response was YES. [2021-03-26 09:57:22,095 INFO L84 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 129 events. 50/129 cut-off events. For 329/360 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 465 event pairs, 4 based on Foata normal form. 11/133 useless extension candidates. Maximal degree in co-relation 521. Up to 82 conditions per place. [2021-03-26 09:57:22,096 INFO L132 encePairwiseOnDemand]: 206/209 looper letters, 4 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2021-03-26 09:57:22,096 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 240 flow [2021-03-26 09:57:22,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 09:57:22,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 09:57:22,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 743 transitions. [2021-03-26 09:57:22,098 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.888755980861244 [2021-03-26 09:57:22,098 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 743 transitions. [2021-03-26 09:57:22,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 743 transitions. [2021-03-26 09:57:22,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:57:22,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 743 transitions. [2021-03-26 09:57:22,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 185.75) internal successors, (743), 4 states have internal predecessors, (743), 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-26 09:57:22,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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-26 09:57:22,102 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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-26 09:57:22,102 INFO L185 Difference]: Start difference. First operand has 47 places, 37 transitions, 222 flow. Second operand 4 states and 743 transitions. [2021-03-26 09:57:22,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 240 flow [2021-03-26 09:57:22,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 186 flow, removed 18 selfloop flow, removed 5 redundant places. [2021-03-26 09:57:22,106 INFO L241 Difference]: Finished difference. Result has 47 places, 38 transitions, 181 flow [2021-03-26 09:57:22,106 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2021-03-26 09:57:22,106 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -11 predicate places. [2021-03-26 09:57:22,106 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:57:22,106 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 38 transitions, 181 flow [2021-03-26 09:57:22,106 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 181 flow [2021-03-26 09:57:22,107 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 181 flow [2021-03-26 09:57:22,117 INFO L129 PetriNetUnfolder]: 49/127 cut-off events. [2021-03-26 09:57:22,117 INFO L130 PetriNetUnfolder]: For 221/237 co-relation queries the response was YES. [2021-03-26 09:57:22,118 INFO L84 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 127 events. 49/127 cut-off events. For 221/237 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 471 event pairs, 4 based on Foata normal form. 6/126 useless extension candidates. Maximal degree in co-relation 371. Up to 60 conditions per place. [2021-03-26 09:57:22,119 INFO L142 LiptonReduction]: Number of co-enabled transitions 442 [2021-03-26 09:57:22,126 INFO L154 LiptonReduction]: Checked pairs total: 407 [2021-03-26 09:57:22,127 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:57:22,127 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21 [2021-03-26 09:57:22,133 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 181 flow [2021-03-26 09:57:22,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 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-26 09:57:22,133 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:57:22,134 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:57:22,134 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 09:57:22,134 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:57:22,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:57:22,134 INFO L82 PathProgramCache]: Analyzing trace with hash 45683258, now seen corresponding path program 2 times [2021-03-26 09:57:22,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:57:22,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903391142] [2021-03-26 09:57:22,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:57:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:57:22,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:22,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:22,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:22,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:22,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:22,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:22,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:22,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:22,253 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 09:57:22,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 09:57:22,262 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:22,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:57:22,264 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-26 09:57:22,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903391142] [2021-03-26 09:57:22,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:57:22,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 09:57:22,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647649231] [2021-03-26 09:57:22,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 09:57:22,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:57:22,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 09:57:22,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 09:57:22,266 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 209 [2021-03-26 09:57:22,267 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 181 flow. Second operand has 7 states, 7 states have (on average 176.85714285714286) internal successors, (1238), 7 states have internal predecessors, (1238), 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-26 09:57:22,267 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:57:22,267 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 209 [2021-03-26 09:57:22,267 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:57:22,359 INFO L129 PetriNetUnfolder]: 39/103 cut-off events. [2021-03-26 09:57:22,360 INFO L130 PetriNetUnfolder]: For 232/313 co-relation queries the response was YES. [2021-03-26 09:57:22,360 INFO L84 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 103 events. 39/103 cut-off events. For 232/313 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 0 based on Foata normal form. 37/133 useless extension candidates. Maximal degree in co-relation 371. Up to 51 conditions per place. [2021-03-26 09:57:22,361 INFO L132 encePairwiseOnDemand]: 202/209 looper letters, 2 selfloop transitions, 17 changer transitions 5/43 dead transitions. [2021-03-26 09:57:22,361 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 43 transitions, 277 flow [2021-03-26 09:57:22,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 09:57:22,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 09:57:22,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1434 transitions. [2021-03-26 09:57:22,364 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8576555023923444 [2021-03-26 09:57:22,365 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1434 transitions. [2021-03-26 09:57:22,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1434 transitions. [2021-03-26 09:57:22,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:57:22,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1434 transitions. [2021-03-26 09:57:22,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 179.25) internal successors, (1434), 8 states have internal predecessors, (1434), 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-26 09:57:22,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 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-26 09:57:22,373 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 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-26 09:57:22,373 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 181 flow. Second operand 8 states and 1434 transitions. [2021-03-26 09:57:22,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 43 transitions, 277 flow [2021-03-26 09:57:22,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 43 transitions, 256 flow, removed 9 selfloop flow, removed 2 redundant places. [2021-03-26 09:57:22,376 INFO L241 Difference]: Finished difference. Result has 55 places, 38 transitions, 216 flow [2021-03-26 09:57:22,376 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=216, PETRI_PLACES=55, PETRI_TRANSITIONS=38} [2021-03-26 09:57:22,376 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2021-03-26 09:57:22,376 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:57:22,376 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 38 transitions, 216 flow [2021-03-26 09:57:22,376 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 38 transitions, 216 flow [2021-03-26 09:57:22,377 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 38 transitions, 216 flow [2021-03-26 09:57:22,386 INFO L129 PetriNetUnfolder]: 33/87 cut-off events. [2021-03-26 09:57:22,387 INFO L130 PetriNetUnfolder]: For 137/152 co-relation queries the response was YES. [2021-03-26 09:57:22,387 INFO L84 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 87 events. 33/87 cut-off events. For 137/152 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 274 event pairs, 0 based on Foata normal form. 1/81 useless extension candidates. Maximal degree in co-relation 283. Up to 35 conditions per place. [2021-03-26 09:57:22,388 INFO L142 LiptonReduction]: Number of co-enabled transitions 378 [2021-03-26 09:57:22,723 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-03-26 09:57:22,860 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-03-26 09:57:23,189 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-03-26 09:57:23,341 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-03-26 09:57:23,348 INFO L154 LiptonReduction]: Checked pairs total: 1113 [2021-03-26 09:57:23,348 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 09:57:23,349 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 973 [2021-03-26 09:57:23,349 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 212 flow [2021-03-26 09:57:23,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 176.85714285714286) internal successors, (1238), 7 states have internal predecessors, (1238), 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-26 09:57:23,350 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:57:23,350 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:57:23,350 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 09:57:23,350 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:57:23,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:57:23,350 INFO L82 PathProgramCache]: Analyzing trace with hash -699336013, now seen corresponding path program 1 times [2021-03-26 09:57:23,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:57:23,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511370964] [2021-03-26 09:57:23,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:57:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:57:23,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:23,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:57:23,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:23,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:23,402 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 09:57:23,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 09:57:23,414 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-26 09:57:23,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511370964] [2021-03-26 09:57:23,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:57:23,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:57:23,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043483616] [2021-03-26 09:57:23,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:57:23,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:57:23,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:57:23,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:57:23,416 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 211 [2021-03-26 09:57:23,417 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 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-26 09:57:23,417 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:57:23,417 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 211 [2021-03-26 09:57:23,417 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:57:23,502 INFO L129 PetriNetUnfolder]: 152/349 cut-off events. [2021-03-26 09:57:23,502 INFO L130 PetriNetUnfolder]: For 1377/1518 co-relation queries the response was YES. [2021-03-26 09:57:23,504 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 349 events. 152/349 cut-off events. For 1377/1518 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 1900 event pairs, 1 based on Foata normal form. 24/348 useless extension candidates. Maximal degree in co-relation 1106. Up to 116 conditions per place. [2021-03-26 09:57:23,505 INFO L132 encePairwiseOnDemand]: 204/211 looper letters, 8 selfloop transitions, 10 changer transitions 1/47 dead transitions. [2021-03-26 09:57:23,505 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 47 transitions, 278 flow [2021-03-26 09:57:23,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 09:57:23,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 09:57:23,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 863 transitions. [2021-03-26 09:57:23,507 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8180094786729858 [2021-03-26 09:57:23,508 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 863 transitions. [2021-03-26 09:57:23,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 863 transitions. [2021-03-26 09:57:23,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:57:23,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 863 transitions. [2021-03-26 09:57:23,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 172.6) internal successors, (863), 5 states have internal predecessors, (863), 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-26 09:57:23,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 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-26 09:57:23,512 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 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-26 09:57:23,512 INFO L185 Difference]: Start difference. First operand has 51 places, 36 transitions, 212 flow. Second operand 5 states and 863 transitions. [2021-03-26 09:57:23,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 47 transitions, 278 flow [2021-03-26 09:57:23,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 47 transitions, 222 flow, removed 15 selfloop flow, removed 7 redundant places. [2021-03-26 09:57:23,517 INFO L241 Difference]: Finished difference. Result has 50 places, 44 transitions, 223 flow [2021-03-26 09:57:23,518 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=223, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2021-03-26 09:57:23,518 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -8 predicate places. [2021-03-26 09:57:23,518 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:57:23,518 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 44 transitions, 223 flow [2021-03-26 09:57:23,518 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 44 transitions, 223 flow [2021-03-26 09:57:23,519 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 44 transitions, 223 flow [2021-03-26 09:57:23,548 INFO L129 PetriNetUnfolder]: 153/357 cut-off events. [2021-03-26 09:57:23,548 INFO L130 PetriNetUnfolder]: For 438/466 co-relation queries the response was YES. [2021-03-26 09:57:23,550 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1013 conditions, 357 events. 153/357 cut-off events. For 438/466 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2086 event pairs, 16 based on Foata normal form. 12/350 useless extension candidates. Maximal degree in co-relation 997. Up to 110 conditions per place. [2021-03-26 09:57:23,553 INFO L142 LiptonReduction]: Number of co-enabled transitions 468 [2021-03-26 09:57:23,569 INFO L154 LiptonReduction]: Checked pairs total: 218 [2021-03-26 09:57:23,570 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 09:57:23,570 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 52 [2021-03-26 09:57:23,570 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 223 flow [2021-03-26 09:57:23,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 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-26 09:57:23,571 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:57:23,571 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:57:23,571 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 09:57:23,571 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:57:23,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:57:23,571 INFO L82 PathProgramCache]: Analyzing trace with hash 2029537601, now seen corresponding path program 1 times [2021-03-26 09:57:23,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:57:23,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505108306] [2021-03-26 09:57:23,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:57:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:57:23,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:23,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:57:23,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:23,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:23,632 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 09:57:23,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 09:57:23,643 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-26 09:57:23,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505108306] [2021-03-26 09:57:23,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:57:23,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 09:57:23,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086612297] [2021-03-26 09:57:23,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 09:57:23,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:57:23,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 09:57:23,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 09:57:23,645 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 211 [2021-03-26 09:57:23,645 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 223 flow. Second operand has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 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-26 09:57:23,645 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:57:23,646 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 211 [2021-03-26 09:57:23,646 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:57:23,740 INFO L129 PetriNetUnfolder]: 254/579 cut-off events. [2021-03-26 09:57:23,740 INFO L130 PetriNetUnfolder]: For 1082/1181 co-relation queries the response was YES. [2021-03-26 09:57:23,743 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1739 conditions, 579 events. 254/579 cut-off events. For 1082/1181 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 3662 event pairs, 3 based on Foata normal form. 39/590 useless extension candidates. Maximal degree in co-relation 1721. Up to 170 conditions per place. [2021-03-26 09:57:23,744 INFO L132 encePairwiseOnDemand]: 203/211 looper letters, 13 selfloop transitions, 11 changer transitions 9/60 dead transitions. [2021-03-26 09:57:23,744 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 60 transitions, 378 flow [2021-03-26 09:57:23,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 09:57:23,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 09:57:23,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 865 transitions. [2021-03-26 09:57:23,747 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8199052132701422 [2021-03-26 09:57:23,747 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 865 transitions. [2021-03-26 09:57:23,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 865 transitions. [2021-03-26 09:57:23,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:57:23,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 865 transitions. [2021-03-26 09:57:23,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 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-26 09:57:23,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 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-26 09:57:23,752 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 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-26 09:57:23,753 INFO L185 Difference]: Start difference. First operand has 50 places, 44 transitions, 223 flow. Second operand 5 states and 865 transitions. [2021-03-26 09:57:23,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 60 transitions, 378 flow [2021-03-26 09:57:23,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 60 transitions, 378 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 09:57:23,764 INFO L241 Difference]: Finished difference. Result has 56 places, 47 transitions, 279 flow [2021-03-26 09:57:23,764 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=279, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2021-03-26 09:57:23,764 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -2 predicate places. [2021-03-26 09:57:23,764 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:57:23,765 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 47 transitions, 279 flow [2021-03-26 09:57:23,765 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 47 transitions, 279 flow [2021-03-26 09:57:23,765 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 47 transitions, 279 flow [2021-03-26 09:57:23,837 INFO L129 PetriNetUnfolder]: 131/321 cut-off events. [2021-03-26 09:57:23,837 INFO L130 PetriNetUnfolder]: For 575/609 co-relation queries the response was YES. [2021-03-26 09:57:23,838 INFO L84 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 321 events. 131/321 cut-off events. For 575/609 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1905 event pairs, 3 based on Foata normal form. 13/312 useless extension candidates. Maximal degree in co-relation 969. Up to 104 conditions per place. [2021-03-26 09:57:23,841 INFO L142 LiptonReduction]: Number of co-enabled transitions 458 [2021-03-26 09:57:23,886 INFO L154 LiptonReduction]: Checked pairs total: 478 [2021-03-26 09:57:23,887 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 09:57:23,887 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 123 [2021-03-26 09:57:23,887 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 281 flow [2021-03-26 09:57:23,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 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-26 09:57:23,888 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:57:23,888 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:57:23,888 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 09:57:23,888 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:57:23,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:57:23,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1871405737, now seen corresponding path program 2 times [2021-03-26 09:57:23,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:57:23,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140091806] [2021-03-26 09:57:23,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:57:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 09:57:23,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:23,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 09:57:23,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:23,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:23,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 09:57:23,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 09:57:23,967 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-26 09:57:23,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 09:57:23,980 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-26 09:57:23,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140091806] [2021-03-26 09:57:23,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 09:57:23,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 09:57:23,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569456013] [2021-03-26 09:57:23,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 09:57:23,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 09:57:23,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 09:57:23,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 09:57:23,982 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 212 [2021-03-26 09:57:23,983 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 281 flow. Second operand has 5 states, 5 states have (on average 170.6) internal successors, (853), 5 states have internal predecessors, (853), 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-26 09:57:23,983 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 09:57:23,983 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 212 [2021-03-26 09:57:23,983 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 09:57:24,075 INFO L129 PetriNetUnfolder]: 178/430 cut-off events. [2021-03-26 09:57:24,075 INFO L130 PetriNetUnfolder]: For 919/978 co-relation queries the response was YES. [2021-03-26 09:57:24,077 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1386 conditions, 430 events. 178/430 cut-off events. For 919/978 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2679 event pairs, 4 based on Foata normal form. 30/435 useless extension candidates. Maximal degree in co-relation 1364. Up to 134 conditions per place. [2021-03-26 09:57:24,078 INFO L132 encePairwiseOnDemand]: 206/212 looper letters, 10 selfloop transitions, 4 changer transitions 13/54 dead transitions. [2021-03-26 09:57:24,078 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 54 transitions, 379 flow [2021-03-26 09:57:24,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 09:57:24,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 09:57:24,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1036 transitions. [2021-03-26 09:57:24,081 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8144654088050315 [2021-03-26 09:57:24,081 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1036 transitions. [2021-03-26 09:57:24,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1036 transitions. [2021-03-26 09:57:24,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 09:57:24,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1036 transitions. [2021-03-26 09:57:24,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 172.66666666666666) internal successors, (1036), 6 states have internal predecessors, (1036), 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-26 09:57:24,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 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-26 09:57:24,087 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 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-26 09:57:24,087 INFO L185 Difference]: Start difference. First operand has 55 places, 47 transitions, 281 flow. Second operand 6 states and 1036 transitions. [2021-03-26 09:57:24,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 54 transitions, 379 flow [2021-03-26 09:57:24,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 54 transitions, 375 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 09:57:24,095 INFO L241 Difference]: Finished difference. Result has 60 places, 40 transitions, 228 flow [2021-03-26 09:57:24,096 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=228, PETRI_PLACES=60, PETRI_TRANSITIONS=40} [2021-03-26 09:57:24,096 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 2 predicate places. [2021-03-26 09:57:24,096 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 09:57:24,096 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 40 transitions, 228 flow [2021-03-26 09:57:24,096 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 40 transitions, 228 flow [2021-03-26 09:57:24,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 40 transitions, 228 flow [2021-03-26 09:57:24,116 INFO L129 PetriNetUnfolder]: 79/215 cut-off events. [2021-03-26 09:57:24,116 INFO L130 PetriNetUnfolder]: For 463/498 co-relation queries the response was YES. [2021-03-26 09:57:24,117 INFO L84 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 215 events. 79/215 cut-off events. For 463/498 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1118 event pairs, 4 based on Foata normal form. 12/212 useless extension candidates. Maximal degree in co-relation 627. Up to 68 conditions per place. [2021-03-26 09:57:24,119 INFO L142 LiptonReduction]: Number of co-enabled transitions 338 [2021-03-26 09:57:24,858 WARN L205 SmtUtils]: Spent 736.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 09:57:25,431 WARN L205 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 175 [2021-03-26 09:57:26,702 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 302 DAG size of output: 257 [2021-03-26 09:57:27,261 WARN L205 SmtUtils]: Spent 557.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-26 09:57:27,336 INFO L154 LiptonReduction]: Checked pairs total: 302 [2021-03-26 09:57:27,336 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 09:57:27,336 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3240 [2021-03-26 09:57:27,337 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 231 flow [2021-03-26 09:57:27,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 170.6) internal successors, (853), 5 states have internal predecessors, (853), 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-26 09:57:27,337 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 09:57:27,337 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 09:57:27,337 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 09:57:27,337 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 09:57:27,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 09:57:27,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1373463743, now seen corresponding path program 1 times [2021-03-26 09:57:27,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 09:57:27,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861888512] [2021-03-26 09:57:27,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 09:57:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 09:57:27,371 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 09:57:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 09:57:27,420 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 09:57:27,462 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 09:57:27,462 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 09:57:27,462 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 09:57:27,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 09:57:27 BasicIcfg [2021-03-26 09:57:27,615 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 09:57:27,616 INFO L168 Benchmark]: Toolchain (without parser) took 16338.26 ms. Allocated memory was 255.9 MB in the beginning and 704.6 MB in the end (delta: 448.8 MB). Free memory was 232.8 MB in the beginning and 671.7 MB in the end (delta: -438.9 MB). Peak memory consumption was 343.9 MB. Max. memory is 16.0 GB. [2021-03-26 09:57:27,616 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 255.9 MB. Free memory was 237.6 MB in the beginning and 237.4 MB in the end (delta: 181.6 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 09:57:27,617 INFO L168 Benchmark]: CACSL2BoogieTranslator took 534.15 ms. Allocated memory was 255.9 MB in the beginning and 396.4 MB in the end (delta: 140.5 MB). Free memory was 232.8 MB in the beginning and 355.8 MB in the end (delta: -123.0 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-26 09:57:27,617 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.35 ms. Allocated memory is still 396.4 MB. Free memory was 355.8 MB in the beginning and 353.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 09:57:27,617 INFO L168 Benchmark]: Boogie Preprocessor took 33.38 ms. Allocated memory is still 396.4 MB. Free memory was 353.1 MB in the beginning and 351.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 09:57:27,618 INFO L168 Benchmark]: RCFGBuilder took 1619.99 ms. Allocated memory is still 396.4 MB. Free memory was 351.0 MB in the beginning and 354.7 MB in the end (delta: -3.7 MB). Peak memory consumption was 67.4 MB. Max. memory is 16.0 GB. [2021-03-26 09:57:27,620 INFO L168 Benchmark]: TraceAbstraction took 14097.06 ms. Allocated memory was 396.4 MB in the beginning and 704.6 MB in the end (delta: 308.3 MB). Free memory was 353.7 MB in the beginning and 671.7 MB in the end (delta: -318.0 MB). Peak memory consumption was 325.8 MB. Max. memory is 16.0 GB. [2021-03-26 09:57:27,625 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.48 ms. Allocated memory is still 255.9 MB. Free memory was 237.6 MB in the beginning and 237.4 MB in the end (delta: 181.6 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 534.15 ms. Allocated memory was 255.9 MB in the beginning and 396.4 MB in the end (delta: 140.5 MB). Free memory was 232.8 MB in the beginning and 355.8 MB in the end (delta: -123.0 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 49.35 ms. Allocated memory is still 396.4 MB. Free memory was 355.8 MB in the beginning and 353.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 33.38 ms. Allocated memory is still 396.4 MB. Free memory was 353.1 MB in the beginning and 351.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1619.99 ms. Allocated memory is still 396.4 MB. Free memory was 351.0 MB in the beginning and 354.7 MB in the end (delta: -3.7 MB). Peak memory consumption was 67.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 14097.06 ms. Allocated memory was 396.4 MB in the beginning and 704.6 MB in the end (delta: 308.3 MB). Free memory was 353.7 MB in the beginning and 671.7 MB in the end (delta: -318.0 MB). Peak memory consumption was 325.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3285.1ms, 124 PlacesBefore, 58 PlacesAfterwards, 113 TransitionsBefore, 46 TransitionsAfterwards, 2512 CoEnabledTransitionPairs, 5 FixpointIterations, 31 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 4168 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2249, positive: 2156, positive conditional: 2156, positive unconditional: 0, negative: 93, negative conditional: 93, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2249, positive: 2156, positive conditional: 0, positive unconditional: 2156, negative: 93, negative conditional: 0, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2249, positive: 2156, positive conditional: 0, positive unconditional: 2156, negative: 93, negative conditional: 0, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1683, positive: 1644, positive conditional: 0, positive unconditional: 1644, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1683, positive: 1623, positive conditional: 0, positive unconditional: 1623, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 452, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 388, negative conditional: 0, negative unconditional: 388, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2249, positive: 512, positive conditional: 0, positive unconditional: 512, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 1683, unknown conditional: 0, unknown unconditional: 1683] , Statistics on independence cache: Total cache size (in pairs): 1683, Positive cache size: 1644, Positive conditional cache size: 0, Positive unconditional cache size: 1644, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1964.3ms, 54 PlacesBefore, 40 PlacesAfterwards, 43 TransitionsBefore, 29 TransitionsAfterwards, 512 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 14 TotalNumberOfCompositions, 2080 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 791, positive: 680, positive conditional: 680, positive unconditional: 0, negative: 111, negative conditional: 111, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 791, positive: 680, positive conditional: 40, positive unconditional: 640, negative: 111, negative conditional: 4, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 791, positive: 680, positive conditional: 40, positive unconditional: 640, negative: 111, negative conditional: 4, negative unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 222, positive: 194, positive conditional: 10, positive unconditional: 184, negative: 28, negative conditional: 2, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 222, positive: 182, positive conditional: 0, positive unconditional: 182, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 40, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 28, negative conditional: 2, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 529, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 476, negative conditional: 60, negative unconditional: 416, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 791, positive: 486, positive conditional: 30, positive unconditional: 456, negative: 83, negative conditional: 2, negative unconditional: 81, unknown: 222, unknown conditional: 12, unknown unconditional: 210] , Statistics on independence cache: Total cache size (in pairs): 1905, Positive cache size: 1838, Positive conditional cache size: 10, Positive unconditional cache size: 1828, Negative cache size: 67, Negative conditional cache size: 2, Negative unconditional cache size: 65, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1509.2ms, 43 PlacesBefore, 37 PlacesAfterwards, 28 TransitionsBefore, 25 TransitionsAfterwards, 328 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1088 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 510, positive: 443, positive conditional: 443, positive unconditional: 0, negative: 67, negative conditional: 67, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 510, positive: 443, positive conditional: 0, positive unconditional: 443, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 510, positive: 443, positive conditional: 0, positive unconditional: 443, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 13, positive conditional: 0, positive unconditional: 13, 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: 14, positive: 13, positive conditional: 0, positive unconditional: 13, 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: 31, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 510, positive: 430, positive conditional: 0, positive unconditional: 430, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 1919, Positive cache size: 1851, Positive conditional cache size: 10, Positive unconditional cache size: 1841, Negative cache size: 68, Negative conditional cache size: 2, Negative unconditional cache size: 66, Eliminated conditions: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 107.6ms, 42 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 356 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 307 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 97, positive: 81, positive conditional: 81, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 97, positive: 81, positive conditional: 9, positive unconditional: 72, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 97, positive: 81, positive conditional: 9, positive unconditional: 72, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 5, positive conditional: 1, positive unconditional: 4, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 88, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 88, negative conditional: 0, negative unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 97, positive: 76, positive conditional: 8, positive unconditional: 68, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 10, unknown conditional: 1, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 1929, Positive cache size: 1856, Positive conditional cache size: 11, Positive unconditional cache size: 1845, Negative cache size: 73, Negative conditional cache size: 2, Negative unconditional cache size: 71, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 25.0ms, 46 PlacesBefore, 44 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 395 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 121, positive: 103, positive conditional: 103, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 121, positive: 103, positive conditional: 22, positive unconditional: 81, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 121, positive: 103, positive conditional: 22, positive unconditional: 81, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 121, positive: 98, positive conditional: 22, positive unconditional: 76, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1934, Positive cache size: 1861, Positive conditional cache size: 11, Positive unconditional cache size: 1850, Negative cache size: 73, Negative conditional cache size: 2, Negative unconditional cache size: 71, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.5ms, 49 PlacesBefore, 47 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 422 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 136, positive: 117, positive conditional: 117, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 136, positive: 117, positive conditional: 50, positive unconditional: 67, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 136, positive: 117, positive conditional: 50, positive unconditional: 67, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 136, positive: 108, positive conditional: 41, positive unconditional: 67, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1943, Positive cache size: 1870, Positive conditional cache size: 20, Positive unconditional cache size: 1850, Negative cache size: 73, Negative conditional cache size: 2, Negative unconditional cache size: 71, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.1ms, 47 PlacesBefore, 47 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 442 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 407 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 91, positive: 73, positive conditional: 73, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 91, positive: 73, positive conditional: 36, positive unconditional: 37, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 91, positive: 73, positive conditional: 36, positive unconditional: 37, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 3, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 91, positive: 71, positive conditional: 36, positive unconditional: 35, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1946, Positive cache size: 1872, Positive conditional cache size: 20, Positive unconditional cache size: 1852, Negative cache size: 74, Negative conditional cache size: 2, Negative unconditional cache size: 72, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 972.2ms, 55 PlacesBefore, 51 PlacesAfterwards, 38 TransitionsBefore, 36 TransitionsAfterwards, 378 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1113 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 570, positive: 513, positive conditional: 513, positive unconditional: 0, negative: 57, negative conditional: 57, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 570, positive: 513, positive conditional: 297, positive unconditional: 216, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 570, positive: 513, positive conditional: 297, positive unconditional: 216, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 9, positive conditional: 7, positive unconditional: 2, 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: 10, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 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] ], Cache Queries: [ total: 570, positive: 504, positive conditional: 290, positive unconditional: 214, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 10, unknown conditional: 7, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1956, Positive cache size: 1881, Positive conditional cache size: 27, Positive unconditional cache size: 1854, Negative cache size: 75, Negative conditional cache size: 2, Negative unconditional cache size: 73, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 51.4ms, 50 PlacesBefore, 50 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 468 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 218 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, positive: 37, positive conditional: 37, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, positive: 37, positive conditional: 28, positive unconditional: 9, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, positive: 37, positive conditional: 28, positive unconditional: 9, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 6, 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: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 47, positive: 30, positive conditional: 22, positive unconditional: 8, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1963, Positive cache size: 1888, Positive conditional cache size: 33, Positive unconditional cache size: 1855, Negative cache size: 75, Negative conditional cache size: 2, Negative unconditional cache size: 73, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 121.9ms, 56 PlacesBefore, 55 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 458 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 478 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 138, positive: 118, positive conditional: 118, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 138, positive: 118, positive conditional: 90, positive unconditional: 28, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 138, positive: 118, positive conditional: 90, positive unconditional: 28, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 1, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 138, positive: 110, positive conditional: 89, positive unconditional: 21, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 8, unknown conditional: 1, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 1971, Positive cache size: 1896, Positive conditional cache size: 34, Positive unconditional cache size: 1862, Negative cache size: 75, Negative conditional cache size: 2, Negative unconditional cache size: 73, Eliminated conditions: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3239.9ms, 60 PlacesBefore, 56 PlacesAfterwards, 40 TransitionsBefore, 39 TransitionsAfterwards, 338 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 302 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 121, positive: 107, positive conditional: 107, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 121, positive: 107, positive conditional: 60, positive unconditional: 47, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 121, positive: 107, positive conditional: 60, positive unconditional: 47, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 13, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 42, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 121, positive: 96, positive conditional: 60, positive unconditional: 36, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 1984, Positive cache size: 1907, Positive conditional cache size: 34, Positive unconditional cache size: 1873, Negative cache size: 77, Negative conditional cache size: 2, Negative unconditional cache size: 75, Eliminated conditions: 26 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L729] 0 _Bool y$flush_delayed; [L730] 0 int y$mem_tmp; [L731] 0 _Bool y$r_buff0_thd0; [L732] 0 _Bool y$r_buff0_thd1; [L733] 0 _Bool y$r_buff0_thd2; [L734] 0 _Bool y$r_buff0_thd3; [L735] 0 _Bool y$r_buff0_thd4; [L736] 0 _Bool y$r_buff1_thd0; [L737] 0 _Bool y$r_buff1_thd1; [L738] 0 _Bool y$r_buff1_thd2; [L739] 0 _Bool y$r_buff1_thd3; [L740] 0 _Bool y$r_buff1_thd4; [L741] 0 _Bool y$read_delayed; [L742] 0 int *y$read_delayed_var; [L743] 0 int y$w_buff0; [L744] 0 _Bool y$w_buff0_used; [L745] 0 int y$w_buff1; [L746] 0 _Bool y$w_buff1_used; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t437; [L859] FCALL, FORK 0 pthread_create(&t437, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L860] 0 pthread_t t438; [L861] FCALL, FORK 0 pthread_create(&t438, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L862] 0 pthread_t t439; [L863] FCALL, FORK 0 pthread_create(&t439, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L864] 0 pthread_t t440; [L865] FCALL, FORK 0 pthread_create(&t440, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L797] 3 y$w_buff1 = y$w_buff0 [L798] 3 y$w_buff0 = 1 [L799] 3 y$w_buff1_used = y$w_buff0_used [L800] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L802] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L803] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L804] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L805] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L806] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L807] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L810] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 4 z = 1 [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 1 a = 1 [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EAX = y [L784] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, 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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L836] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L836] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L836] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L836] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L837] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L837] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L838] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L838] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L839] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L839] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L840] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L840] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 2 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L871] 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) [L871] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L871] 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) [L871] 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) [L872] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L872] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L873] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L873] 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 [L874] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L874] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L875] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L875] 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 [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, 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_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 116 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 13802.0ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 964.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3394.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 67 SDtfs, 33 SDslu, 42 SDs, 0 SdLazy, 252 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 222.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 191.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=281occurred in iteration=9, InterpolantAutomatonStates: 54, 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: 47.6ms SsaConstructionTime, 402.9ms SatisfiabilityAnalysisTime, 660.2ms InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 193 ConstructedInterpolants, 0 QuantifiedInterpolants, 838 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...