/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix033_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:28:56,017 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:28:56,019 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:28:56,063 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:28:56,064 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:28:56,066 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:28:56,069 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:28:56,076 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:28:56,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:28:56,084 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:28:56,085 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:28:56,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:28:56,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:28:56,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:28:56,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:28:56,091 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:28:56,094 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:28:56,095 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:28:56,097 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:28:56,098 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:28:56,100 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:28:56,101 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:28:56,102 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:28:56,108 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:28:56,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:28:56,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:28:56,114 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:28:56,115 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:28:56,115 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:28:56,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:28:56,116 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:28:56,117 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:28:56,117 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:28:56,118 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:28:56,119 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:28:56,119 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:28:56,119 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:28:56,120 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:28:56,120 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:28:56,121 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:28:56,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:28:56,126 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2021-03-25 14:28:56,162 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:28:56,162 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:28:56,166 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:28:56,166 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:28:56,166 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:28:56,167 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:28:56,167 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:28:56,167 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:28:56,167 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:28:56,167 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:28:56,168 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:28:56,168 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:28:56,168 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:28:56,168 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:28:56,168 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:28:56,169 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:28:56,169 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:28:56,169 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:28:56,169 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:28:56,169 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:28:56,169 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:28:56,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:28:56,170 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:28:56,170 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:28:56,170 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:28:56,170 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:28:56,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:28:56,170 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:28:56,170 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:28:56,171 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 14:28:56,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:28:56,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:28:56,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:28:56,495 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:28:56,495 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:28:56,496 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_pso.opt.i [2021-03-25 14:28:56,551 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9300a9b8b/a12bf1531daa43ad8569d10bb27e9af3/FLAG281debfd5 [2021-03-25 14:28:57,107 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:28:57,108 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_pso.opt.i [2021-03-25 14:28:57,127 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9300a9b8b/a12bf1531daa43ad8569d10bb27e9af3/FLAG281debfd5 [2021-03-25 14:28:57,518 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9300a9b8b/a12bf1531daa43ad8569d10bb27e9af3 [2021-03-25 14:28:57,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:28:57,527 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:28:57,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:28:57,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:28:57,532 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:28:57,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:28:57" (1/1) ... [2021-03-25 14:28:57,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b0b9a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:28:57, skipping insertion in model container [2021-03-25 14:28:57,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:28:57" (1/1) ... [2021-03-25 14:28:57,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:28:57,586 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:28:57,695 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/mix033_pso.opt.i[948,961] [2021-03-25 14:28:57,911 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:28:57,918 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:28:57,928 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/mix033_pso.opt.i[948,961] [2021-03-25 14:28:57,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:28:58,037 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:28:58,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:28:58 WrapperNode [2021-03-25 14:28:58,038 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:28:58,040 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:28:58,040 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:28:58,041 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:28:58,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:28:58" (1/1) ... [2021-03-25 14:28:58,061 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:28:58" (1/1) ... [2021-03-25 14:28:58,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:28:58,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:28:58,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:28:58,088 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:28:58,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:28:58" (1/1) ... [2021-03-25 14:28:58,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:28:58" (1/1) ... [2021-03-25 14:28:58,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:28:58" (1/1) ... [2021-03-25 14:28:58,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:28:58" (1/1) ... [2021-03-25 14:28:58,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:28:58" (1/1) ... [2021-03-25 14:28:58,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:28:58" (1/1) ... [2021-03-25 14:28:58,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:28:58" (1/1) ... [2021-03-25 14:28:58,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:28:58,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:28:58,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:28:58,127 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:28:58,127 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:28:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:28:58,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:28:58,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:28:58,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:28:58,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:28:58,197 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:28:58,198 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:28:58,198 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:28:58,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:28:58,199 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:28:58,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:28:58,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:28:58,199 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:28:58,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:28:58,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:28:58,201 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 14:28:59,536 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:28:59,537 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:28:59,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:28:59 BoogieIcfgContainer [2021-03-25 14:28:59,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:28:59,541 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:28:59,541 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:28:59,543 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:28:59,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:28:57" (1/3) ... [2021-03-25 14:28:59,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128f7244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:28:59, skipping insertion in model container [2021-03-25 14:28:59,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:28:58" (2/3) ... [2021-03-25 14:28:59,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128f7244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:28:59, skipping insertion in model container [2021-03-25 14:28:59,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:28:59" (3/3) ... [2021-03-25 14:28:59,546 INFO L111 eAbstractionObserver]: Analyzing ICFG mix033_pso.opt.i [2021-03-25 14:28:59,551 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:28:59,555 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:28:59,556 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:28:59,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,592 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,592 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,592 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,592 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,593 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,593 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,594 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,594 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,601 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,606 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,607 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,608 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,613 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,613 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,619 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,619 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,619 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,619 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,619 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,620 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,620 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,622 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,623 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,625 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,627 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,627 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,629 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,629 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,630 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,631 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,632 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:28:59,632 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:28:59,649 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 14:28:59,677 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:28:59,677 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:28:59,677 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:28:59,677 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:28:59,677 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:28:59,677 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:28:59,677 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:28:59,677 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:28:59,691 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 223 flow [2021-03-25 14:28:59,736 INFO L129 PetriNetUnfolder]: 2/101 cut-off events. [2021-03-25 14:28:59,736 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:28:59,750 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 101 events. 2/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2021-03-25 14:28:59,750 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 104 transitions, 223 flow [2021-03-25 14:28:59,755 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 101 transitions, 211 flow [2021-03-25 14:28:59,757 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:28:59,769 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 101 transitions, 211 flow [2021-03-25 14:28:59,771 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 101 transitions, 211 flow [2021-03-25 14:28:59,776 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 109 places, 101 transitions, 211 flow [2021-03-25 14:28:59,811 INFO L129 PetriNetUnfolder]: 2/101 cut-off events. [2021-03-25 14:28:59,811 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:28:59,812 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 101 events. 2/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2021-03-25 14:28:59,815 INFO L142 LiptonReduction]: Number of co-enabled transitions 1832 [2021-03-25 14:29:01,098 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:29:01,471 WARN L205 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:29:01,587 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 14:29:02,682 INFO L154 LiptonReduction]: Checked pairs total: 3136 [2021-03-25 14:29:02,682 INFO L156 LiptonReduction]: Total number of compositions: 73 [2021-03-25 14:29:02,684 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2928 [2021-03-25 14:29:02,693 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-25 14:29:02,693 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:29:02,693 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:29:02,694 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:29:02,694 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:29:02,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:29:02,699 INFO L82 PathProgramCache]: Analyzing trace with hash 175322, now seen corresponding path program 1 times [2021-03-25 14:29:02,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:29:02,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277459961] [2021-03-25 14:29:02,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:29:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:29:02,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:02,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:29:02,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:02,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:29:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:29:02,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277459961] [2021-03-25 14:29:02,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:29:02,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:29:02,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919408301] [2021-03-25 14:29:02,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:29:02,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:29:02,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:29:02,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:29:02,998 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 177 [2021-03-25 14:29:03,004 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:03,004 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:29:03,004 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 177 [2021-03-25 14:29:03,005 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:29:03,060 INFO L129 PetriNetUnfolder]: 9/72 cut-off events. [2021-03-25 14:29:03,060 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:29:03,061 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 72 events. 9/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 198 event pairs, 3 based on Foata normal form. 6/70 useless extension candidates. Maximal degree in co-relation 83. Up to 17 conditions per place. [2021-03-25 14:29:03,062 INFO L132 encePairwiseOnDemand]: 173/177 looper letters, 5 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2021-03-25 14:29:03,062 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 38 transitions, 99 flow [2021-03-25 14:29:03,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:29:03,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:29:03,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 481 transitions. [2021-03-25 14:29:03,081 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9058380414312618 [2021-03-25 14:29:03,082 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 481 transitions. [2021-03-25 14:29:03,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 481 transitions. [2021-03-25 14:29:03,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:29:03,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 481 transitions. [2021-03-25 14:29:03,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:03,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:03,100 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:03,102 INFO L185 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 481 transitions. [2021-03-25 14:29:03,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 38 transitions, 99 flow [2021-03-25 14:29:03,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 38 transitions, 96 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 14:29:03,106 INFO L241 Difference]: Finished difference. Result has 45 places, 36 transitions, 82 flow [2021-03-25 14:29:03,107 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2021-03-25 14:29:03,109 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2021-03-25 14:29:03,109 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:29:03,110 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 36 transitions, 82 flow [2021-03-25 14:29:03,111 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 36 transitions, 82 flow [2021-03-25 14:29:03,111 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 82 flow [2021-03-25 14:29:03,119 INFO L129 PetriNetUnfolder]: 0/36 cut-off events. [2021-03-25 14:29:03,119 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:29:03,120 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 0/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:29:03,121 INFO L142 LiptonReduction]: Number of co-enabled transitions 302 [2021-03-25 14:29:04,517 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 102 [2021-03-25 14:29:04,851 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 102 [2021-03-25 14:29:04,984 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-25 14:29:04,991 INFO L154 LiptonReduction]: Checked pairs total: 1734 [2021-03-25 14:29:04,992 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-25 14:29:04,992 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1883 [2021-03-25 14:29:04,993 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-25 14:29:04,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:04,994 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:29:04,994 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:29:04,994 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:29:04,994 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:29:04,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:29:04,995 INFO L82 PathProgramCache]: Analyzing trace with hash 930779888, now seen corresponding path program 1 times [2021-03-25 14:29:04,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:29:04,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889581007] [2021-03-25 14:29:04,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:29:05,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:29:05,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:05,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:29:05,098 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:29:05,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:29:05,111 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:29:05,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:29:05,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:29:05,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889581007] [2021-03-25 14:29:05,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:29:05,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:29:05,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696153903] [2021-03-25 14:29:05,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:29:05,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:29:05,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:29:05,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:29:05,118 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 189 [2021-03-25 14:29:05,119 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:05,119 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:29:05,119 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 189 [2021-03-25 14:29:05,119 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:29:05,257 INFO L129 PetriNetUnfolder]: 148/348 cut-off events. [2021-03-25 14:29:05,257 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:29:05,260 INFO L84 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 348 events. 148/348 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 1887 event pairs, 34 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 611. Up to 117 conditions per place. [2021-03-25 14:29:05,263 INFO L132 encePairwiseOnDemand]: 180/189 looper letters, 7 selfloop transitions, 7 changer transitions 14/43 dead transitions. [2021-03-25 14:29:05,263 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 152 flow [2021-03-25 14:29:05,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:29:05,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:29:05,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 744 transitions. [2021-03-25 14:29:05,267 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7873015873015873 [2021-03-25 14:29:05,267 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 744 transitions. [2021-03-25 14:29:05,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 744 transitions. [2021-03-25 14:29:05,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:29:05,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 744 transitions. [2021-03-25 14:29:05,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:05,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:05,274 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:05,275 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 5 states and 744 transitions. [2021-03-25 14:29:05,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 152 flow [2021-03-25 14:29:05,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 43 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:29:05,276 INFO L241 Difference]: Finished difference. Result has 39 places, 29 transitions, 118 flow [2021-03-25 14:29:05,277 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2021-03-25 14:29:05,277 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -9 predicate places. [2021-03-25 14:29:05,277 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:29:05,277 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 118 flow [2021-03-25 14:29:05,278 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 118 flow [2021-03-25 14:29:05,278 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 118 flow [2021-03-25 14:29:05,304 INFO L129 PetriNetUnfolder]: 72/196 cut-off events. [2021-03-25 14:29:05,305 INFO L130 PetriNetUnfolder]: For 48/54 co-relation queries the response was YES. [2021-03-25 14:29:05,305 INFO L84 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 196 events. 72/196 cut-off events. For 48/54 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1014 event pairs, 38 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 453. Up to 117 conditions per place. [2021-03-25 14:29:05,310 INFO L142 LiptonReduction]: Number of co-enabled transitions 280 [2021-03-25 14:29:05,632 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-25 14:29:05,785 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-25 14:29:06,057 WARN L205 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-25 14:29:06,179 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-25 14:29:06,190 INFO L154 LiptonReduction]: Checked pairs total: 352 [2021-03-25 14:29:06,190 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:29:06,191 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 914 [2021-03-25 14:29:06,191 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 116 flow [2021-03-25 14:29:06,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:06,192 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:29:06,192 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:29:06,192 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:29:06,192 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:29:06,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:29:06,193 INFO L82 PathProgramCache]: Analyzing trace with hash -957009747, now seen corresponding path program 1 times [2021-03-25 14:29:06,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:29:06,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302480917] [2021-03-25 14:29:06,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:29:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:29:06,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:06,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:29:06,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:29:06,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302480917] [2021-03-25 14:29:06,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:29:06,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:29:06,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092199063] [2021-03-25 14:29:06,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:29:06,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:29:06,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:29:06,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:29:06,276 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 190 [2021-03-25 14:29:06,277 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:06,277 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:29:06,277 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 190 [2021-03-25 14:29:06,277 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:29:06,300 INFO L129 PetriNetUnfolder]: 57/182 cut-off events. [2021-03-25 14:29:06,300 INFO L130 PetriNetUnfolder]: For 82/88 co-relation queries the response was YES. [2021-03-25 14:29:06,301 INFO L84 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 182 events. 57/182 cut-off events. For 82/88 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 905 event pairs, 24 based on Foata normal form. 2/179 useless extension candidates. Maximal degree in co-relation 425. Up to 96 conditions per place. [2021-03-25 14:29:06,302 INFO L132 encePairwiseOnDemand]: 187/190 looper letters, 1 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2021-03-25 14:29:06,302 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 124 flow [2021-03-25 14:29:06,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:29:06,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:29:06,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2021-03-25 14:29:06,304 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.875438596491228 [2021-03-25 14:29:06,304 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 499 transitions. [2021-03-25 14:29:06,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 499 transitions. [2021-03-25 14:29:06,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:29:06,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 499 transitions. [2021-03-25 14:29:06,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:06,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:06,307 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:06,308 INFO L185 Difference]: Start difference. First operand has 35 places, 28 transitions, 116 flow. Second operand 3 states and 499 transitions. [2021-03-25 14:29:06,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 124 flow [2021-03-25 14:29:06,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 98 flow, removed 6 selfloop flow, removed 4 redundant places. [2021-03-25 14:29:06,310 INFO L241 Difference]: Finished difference. Result has 34 places, 28 transitions, 101 flow [2021-03-25 14:29:06,310 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2021-03-25 14:29:06,311 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -14 predicate places. [2021-03-25 14:29:06,311 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:29:06,311 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 28 transitions, 101 flow [2021-03-25 14:29:06,311 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 28 transitions, 101 flow [2021-03-25 14:29:06,312 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 28 transitions, 101 flow [2021-03-25 14:29:06,325 INFO L129 PetriNetUnfolder]: 57/164 cut-off events. [2021-03-25 14:29:06,325 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-03-25 14:29:06,326 INFO L84 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 164 events. 57/164 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 798 event pairs, 26 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 319. Up to 96 conditions per place. [2021-03-25 14:29:06,327 INFO L142 LiptonReduction]: Number of co-enabled transitions 278 [2021-03-25 14:29:06,333 INFO L154 LiptonReduction]: Checked pairs total: 175 [2021-03-25 14:29:06,333 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:29:06,333 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22 [2021-03-25 14:29:06,334 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 101 flow [2021-03-25 14:29:06,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:06,335 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:29:06,335 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:29:06,335 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:29:06,335 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:29:06,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:29:06,336 INFO L82 PathProgramCache]: Analyzing trace with hash 2017287020, now seen corresponding path program 1 times [2021-03-25 14:29:06,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:29:06,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280430600] [2021-03-25 14:29:06,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:29:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:29:06,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:06,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:29:06,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:29:06,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280430600] [2021-03-25 14:29:06,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:29:06,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:29:06,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139384742] [2021-03-25 14:29:06,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:29:06,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:29:06,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:29:06,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:29:06,378 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 190 [2021-03-25 14:29:06,379 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:06,379 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:29:06,379 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 190 [2021-03-25 14:29:06,379 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:29:06,404 INFO L129 PetriNetUnfolder]: 51/154 cut-off events. [2021-03-25 14:29:06,404 INFO L130 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2021-03-25 14:29:06,404 INFO L84 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 154 events. 51/154 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 693 event pairs, 23 based on Foata normal form. 2/151 useless extension candidates. Maximal degree in co-relation 339. Up to 88 conditions per place. [2021-03-25 14:29:06,405 INFO L132 encePairwiseOnDemand]: 186/190 looper letters, 4 selfloop transitions, 5 changer transitions 0/31 dead transitions. [2021-03-25 14:29:06,405 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 131 flow [2021-03-25 14:29:06,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:29:06,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:29:06,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 493 transitions. [2021-03-25 14:29:06,407 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8649122807017544 [2021-03-25 14:29:06,407 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 493 transitions. [2021-03-25 14:29:06,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 493 transitions. [2021-03-25 14:29:06,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:29:06,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 493 transitions. [2021-03-25 14:29:06,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:06,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:06,411 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:06,411 INFO L185 Difference]: Start difference. First operand has 34 places, 28 transitions, 101 flow. Second operand 3 states and 493 transitions. [2021-03-25 14:29:06,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 131 flow [2021-03-25 14:29:06,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 31 transitions, 125 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:29:06,414 INFO L241 Difference]: Finished difference. Result has 35 places, 31 transitions, 130 flow [2021-03-25 14:29:06,414 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2021-03-25 14:29:06,414 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -13 predicate places. [2021-03-25 14:29:06,414 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:29:06,414 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 31 transitions, 130 flow [2021-03-25 14:29:06,415 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 31 transitions, 130 flow [2021-03-25 14:29:06,415 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 31 transitions, 130 flow [2021-03-25 14:29:06,430 INFO L129 PetriNetUnfolder]: 51/154 cut-off events. [2021-03-25 14:29:06,430 INFO L130 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2021-03-25 14:29:06,430 INFO L84 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 154 events. 51/154 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 731 event pairs, 22 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 334. Up to 88 conditions per place. [2021-03-25 14:29:06,432 INFO L142 LiptonReduction]: Number of co-enabled transitions 310 [2021-03-25 14:29:06,437 INFO L154 LiptonReduction]: Checked pairs total: 213 [2021-03-25 14:29:06,437 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:29:06,437 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 23 [2021-03-25 14:29:06,441 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 130 flow [2021-03-25 14:29:06,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:06,441 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:29:06,441 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:29:06,441 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:29:06,442 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:29:06,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:29:06,443 INFO L82 PathProgramCache]: Analyzing trace with hash -27186906, now seen corresponding path program 1 times [2021-03-25 14:29:06,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:29:06,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27629634] [2021-03-25 14:29:06,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:29:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:29:06,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:06,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:29:06,516 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:29:06,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:29:06,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:29:06,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27629634] [2021-03-25 14:29:06,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:29:06,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:29:06,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538439929] [2021-03-25 14:29:06,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:29:06,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:29:06,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:29:06,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:29:06,537 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 190 [2021-03-25 14:29:06,538 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:06,538 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:29:06,538 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 190 [2021-03-25 14:29:06,538 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:29:06,579 INFO L129 PetriNetUnfolder]: 39/132 cut-off events. [2021-03-25 14:29:06,579 INFO L130 PetriNetUnfolder]: For 58/88 co-relation queries the response was YES. [2021-03-25 14:29:06,580 INFO L84 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 132 events. 39/132 cut-off events. For 58/88 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 565 event pairs, 12 based on Foata normal form. 7/135 useless extension candidates. Maximal degree in co-relation 361. Up to 70 conditions per place. [2021-03-25 14:29:06,580 INFO L132 encePairwiseOnDemand]: 183/190 looper letters, 15 selfloop transitions, 7 changer transitions 0/36 dead transitions. [2021-03-25 14:29:06,581 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 36 transitions, 198 flow [2021-03-25 14:29:06,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:29:06,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:29:06,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 603 transitions. [2021-03-25 14:29:06,583 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7934210526315789 [2021-03-25 14:29:06,583 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 603 transitions. [2021-03-25 14:29:06,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 603 transitions. [2021-03-25 14:29:06,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:29:06,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 603 transitions. [2021-03-25 14:29:06,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:06,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 190.0) internal successors, (950), 5 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:06,587 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 190.0) internal successors, (950), 5 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:06,587 INFO L185 Difference]: Start difference. First operand has 35 places, 31 transitions, 130 flow. Second operand 4 states and 603 transitions. [2021-03-25 14:29:06,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 36 transitions, 198 flow [2021-03-25 14:29:06,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 36 transitions, 193 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:29:06,589 INFO L241 Difference]: Finished difference. Result has 40 places, 34 transitions, 176 flow [2021-03-25 14:29:06,589 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2021-03-25 14:29:06,589 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -8 predicate places. [2021-03-25 14:29:06,589 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:29:06,589 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 34 transitions, 176 flow [2021-03-25 14:29:06,590 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 34 transitions, 176 flow [2021-03-25 14:29:06,590 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 34 transitions, 176 flow [2021-03-25 14:29:06,603 INFO L129 PetriNetUnfolder]: 39/133 cut-off events. [2021-03-25 14:29:06,603 INFO L130 PetriNetUnfolder]: For 123/127 co-relation queries the response was YES. [2021-03-25 14:29:06,604 INFO L84 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 133 events. 39/133 cut-off events. For 123/127 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 603 event pairs, 13 based on Foata normal form. 1/128 useless extension candidates. Maximal degree in co-relation 347. Up to 70 conditions per place. [2021-03-25 14:29:06,605 INFO L142 LiptonReduction]: Number of co-enabled transitions 342 [2021-03-25 14:29:06,608 INFO L154 LiptonReduction]: Checked pairs total: 319 [2021-03-25 14:29:06,608 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:29:06,609 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20 [2021-03-25 14:29:06,609 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 176 flow [2021-03-25 14:29:06,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:06,610 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:29:06,610 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:29:06,610 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:29:06,610 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:29:06,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:29:06,611 INFO L82 PathProgramCache]: Analyzing trace with hash 414367007, now seen corresponding path program 1 times [2021-03-25 14:29:06,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:29:06,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826913339] [2021-03-25 14:29:06,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:29:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:29:06,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:06,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:29:06,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:06,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:29:06,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:06,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:29:06,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:29:06,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826913339] [2021-03-25 14:29:06,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:29:06,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:29:06,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24645000] [2021-03-25 14:29:06,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:29:06,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:29:06,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:29:06,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:29:06,675 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 190 [2021-03-25 14:29:06,676 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:06,676 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:29:06,676 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 190 [2021-03-25 14:29:06,676 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:29:06,756 INFO L129 PetriNetUnfolder]: 215/503 cut-off events. [2021-03-25 14:29:06,756 INFO L130 PetriNetUnfolder]: For 202/213 co-relation queries the response was YES. [2021-03-25 14:29:06,758 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 503 events. 215/503 cut-off events. For 202/213 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 3349 event pairs, 83 based on Foata normal form. 43/448 useless extension candidates. Maximal degree in co-relation 1145. Up to 327 conditions per place. [2021-03-25 14:29:06,760 INFO L132 encePairwiseOnDemand]: 184/190 looper letters, 10 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2021-03-25 14:29:06,760 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 234 flow [2021-03-25 14:29:06,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:29:06,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:29:06,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 795 transitions. [2021-03-25 14:29:06,763 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8368421052631579 [2021-03-25 14:29:06,763 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 795 transitions. [2021-03-25 14:29:06,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 795 transitions. [2021-03-25 14:29:06,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:29:06,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 795 transitions. [2021-03-25 14:29:06,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 159.0) internal successors, (795), 5 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:06,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 190.0) internal successors, (1140), 6 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:06,768 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 190.0) internal successors, (1140), 6 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:06,768 INFO L185 Difference]: Start difference. First operand has 40 places, 34 transitions, 176 flow. Second operand 5 states and 795 transitions. [2021-03-25 14:29:06,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 234 flow [2021-03-25 14:29:06,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 231 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:29:06,772 INFO L241 Difference]: Finished difference. Result has 46 places, 41 transitions, 233 flow [2021-03-25 14:29:06,773 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=233, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2021-03-25 14:29:06,773 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2021-03-25 14:29:06,773 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:29:06,773 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 41 transitions, 233 flow [2021-03-25 14:29:06,773 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 41 transitions, 233 flow [2021-03-25 14:29:06,774 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 41 transitions, 233 flow [2021-03-25 14:29:06,810 INFO L129 PetriNetUnfolder]: 156/403 cut-off events. [2021-03-25 14:29:06,810 INFO L130 PetriNetUnfolder]: For 390/440 co-relation queries the response was YES. [2021-03-25 14:29:06,812 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1209 conditions, 403 events. 156/403 cut-off events. For 390/440 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2614 event pairs, 56 based on Foata normal form. 12/386 useless extension candidates. Maximal degree in co-relation 1190. Up to 223 conditions per place. [2021-03-25 14:29:06,816 INFO L142 LiptonReduction]: Number of co-enabled transitions 494 [2021-03-25 14:29:06,834 INFO L154 LiptonReduction]: Checked pairs total: 463 [2021-03-25 14:29:06,834 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:29:06,834 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 61 [2021-03-25 14:29:06,835 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 227 flow [2021-03-25 14:29:06,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:06,836 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:29:06,836 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:29:06,836 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:29:06,836 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:29:06,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:29:06,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1657950987, now seen corresponding path program 1 times [2021-03-25 14:29:06,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:29:06,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926104398] [2021-03-25 14:29:06,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:29:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:29:06,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:06,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:29:06,924 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-03-25 14:29:06,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:29:06,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:06,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:29:06,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:06,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:29:06,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:29:06,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926104398] [2021-03-25 14:29:06,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:29:06,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:29:06,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285928526] [2021-03-25 14:29:06,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:29:06,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:29:06,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:29:06,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:29:06,940 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 190 [2021-03-25 14:29:06,941 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 227 flow. Second operand has 5 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:06,941 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:29:06,941 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 190 [2021-03-25 14:29:06,941 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:29:07,008 INFO L129 PetriNetUnfolder]: 140/358 cut-off events. [2021-03-25 14:29:07,008 INFO L130 PetriNetUnfolder]: For 391/564 co-relation queries the response was YES. [2021-03-25 14:29:07,010 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1244 conditions, 358 events. 140/358 cut-off events. For 391/564 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2103 event pairs, 15 based on Foata normal form. 70/390 useless extension candidates. Maximal degree in co-relation 1223. Up to 212 conditions per place. [2021-03-25 14:29:07,013 INFO L132 encePairwiseOnDemand]: 184/190 looper letters, 8 selfloop transitions, 11 changer transitions 3/49 dead transitions. [2021-03-25 14:29:07,013 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 49 transitions, 315 flow [2021-03-25 14:29:07,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:29:07,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:29:07,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 954 transitions. [2021-03-25 14:29:07,016 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8368421052631579 [2021-03-25 14:29:07,016 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 954 transitions. [2021-03-25 14:29:07,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 954 transitions. [2021-03-25 14:29:07,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:29:07,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 954 transitions. [2021-03-25 14:29:07,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 159.0) internal successors, (954), 6 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:07,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 190.0) internal successors, (1330), 7 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:07,021 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 190.0) internal successors, (1330), 7 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:07,021 INFO L185 Difference]: Start difference. First operand has 46 places, 40 transitions, 227 flow. Second operand 6 states and 954 transitions. [2021-03-25 14:29:07,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 49 transitions, 315 flow [2021-03-25 14:29:07,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 309 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:29:07,026 INFO L241 Difference]: Finished difference. Result has 50 places, 44 transitions, 291 flow [2021-03-25 14:29:07,026 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=291, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2021-03-25 14:29:07,026 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2021-03-25 14:29:07,026 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:29:07,027 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 44 transitions, 291 flow [2021-03-25 14:29:07,027 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 44 transitions, 291 flow [2021-03-25 14:29:07,027 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 44 transitions, 291 flow [2021-03-25 14:29:07,050 INFO L129 PetriNetUnfolder]: 76/250 cut-off events. [2021-03-25 14:29:07,050 INFO L130 PetriNetUnfolder]: For 492/517 co-relation queries the response was YES. [2021-03-25 14:29:07,052 INFO L84 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 250 events. 76/250 cut-off events. For 492/517 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1450 event pairs, 10 based on Foata normal form. 1/243 useless extension candidates. Maximal degree in co-relation 935. Up to 146 conditions per place. [2021-03-25 14:29:07,054 INFO L142 LiptonReduction]: Number of co-enabled transitions 466 [2021-03-25 14:29:07,064 INFO L154 LiptonReduction]: Checked pairs total: 461 [2021-03-25 14:29:07,064 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:29:07,064 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 38 [2021-03-25 14:29:07,064 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 283 flow [2021-03-25 14:29:07,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:07,065 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:29:07,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-25 14:29:07,065 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:29:07,065 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:29:07,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:29:07,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1637098857, now seen corresponding path program 1 times [2021-03-25 14:29:07,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:29:07,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821901311] [2021-03-25 14:29:07,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:29:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:29:07,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:07,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:29:07,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:07,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:29:07,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:07,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:29:07,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:07,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:29:07,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:07,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:29:07,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:29:07,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821901311] [2021-03-25 14:29:07,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:29:07,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:29:07,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434979033] [2021-03-25 14:29:07,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:29:07,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:29:07,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:29:07,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:29:07,158 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 190 [2021-03-25 14:29:07,158 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 283 flow. Second operand has 6 states, 6 states have (on average 155.83333333333334) internal successors, (935), 6 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:07,159 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:29:07,159 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 190 [2021-03-25 14:29:07,159 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:29:07,225 INFO L129 PetriNetUnfolder]: 110/265 cut-off events. [2021-03-25 14:29:07,225 INFO L130 PetriNetUnfolder]: For 610/752 co-relation queries the response was YES. [2021-03-25 14:29:07,227 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 265 events. 110/265 cut-off events. For 610/752 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1337 event pairs, 8 based on Foata normal form. 43/272 useless extension candidates. Maximal degree in co-relation 1032. Up to 144 conditions per place. [2021-03-25 14:29:07,228 INFO L132 encePairwiseOnDemand]: 184/190 looper letters, 5 selfloop transitions, 11 changer transitions 4/47 dead transitions. [2021-03-25 14:29:07,228 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 47 transitions, 329 flow [2021-03-25 14:29:07,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:29:07,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:29:07,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1107 transitions. [2021-03-25 14:29:07,232 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8323308270676691 [2021-03-25 14:29:07,232 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1107 transitions. [2021-03-25 14:29:07,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1107 transitions. [2021-03-25 14:29:07,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:29:07,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1107 transitions. [2021-03-25 14:29:07,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 158.14285714285714) internal successors, (1107), 7 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:07,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 190.0) internal successors, (1520), 8 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:07,237 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 190.0) internal successors, (1520), 8 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:07,237 INFO L185 Difference]: Start difference. First operand has 50 places, 43 transitions, 283 flow. Second operand 7 states and 1107 transitions. [2021-03-25 14:29:07,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 47 transitions, 329 flow [2021-03-25 14:29:07,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 47 transitions, 296 flow, removed 11 selfloop flow, removed 5 redundant places. [2021-03-25 14:29:07,243 INFO L241 Difference]: Finished difference. Result has 52 places, 41 transitions, 262 flow [2021-03-25 14:29:07,243 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2021-03-25 14:29:07,243 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2021-03-25 14:29:07,243 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:29:07,243 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 41 transitions, 262 flow [2021-03-25 14:29:07,244 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 41 transitions, 262 flow [2021-03-25 14:29:07,244 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 262 flow [2021-03-25 14:29:07,259 INFO L129 PetriNetUnfolder]: 46/157 cut-off events. [2021-03-25 14:29:07,259 INFO L130 PetriNetUnfolder]: For 251/256 co-relation queries the response was YES. [2021-03-25 14:29:07,260 INFO L84 FinitePrefix]: Finished finitePrefix Result has 570 conditions, 157 events. 46/157 cut-off events. For 251/256 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 731 event pairs, 6 based on Foata normal form. 1/151 useless extension candidates. Maximal degree in co-relation 548. Up to 51 conditions per place. [2021-03-25 14:29:07,261 INFO L142 LiptonReduction]: Number of co-enabled transitions 334 [2021-03-25 14:29:07,565 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:29:07,673 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-25 14:29:08,028 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 14:29:08,154 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-25 14:29:08,159 INFO L154 LiptonReduction]: Checked pairs total: 488 [2021-03-25 14:29:08,159 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:29:08,159 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 916 [2021-03-25 14:29:08,159 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 248 flow [2021-03-25 14:29:08,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 155.83333333333334) internal successors, (935), 6 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:08,160 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:29:08,160 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:29:08,160 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:29:08,160 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:29:08,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:29:08,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1964175552, now seen corresponding path program 1 times [2021-03-25 14:29:08,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:29:08,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927440024] [2021-03-25 14:29:08,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:29:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:29:08,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:08,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:29:08,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:08,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:29:08,204 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:29:08,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:29:08,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:29:08,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927440024] [2021-03-25 14:29:08,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:29:08,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:29:08,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848826027] [2021-03-25 14:29:08,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:29:08,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:29:08,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:29:08,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:29:08,215 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 192 [2021-03-25 14:29:08,216 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 248 flow. Second operand has 4 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:08,216 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:29:08,216 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 192 [2021-03-25 14:29:08,216 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:29:08,282 INFO L129 PetriNetUnfolder]: 71/199 cut-off events. [2021-03-25 14:29:08,282 INFO L130 PetriNetUnfolder]: For 384/473 co-relation queries the response was YES. [2021-03-25 14:29:08,283 INFO L84 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 199 events. 71/199 cut-off events. For 384/473 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 928 event pairs, 8 based on Foata normal form. 25/218 useless extension candidates. Maximal degree in co-relation 733. Up to 73 conditions per place. [2021-03-25 14:29:08,284 INFO L132 encePairwiseOnDemand]: 183/192 looper letters, 16 selfloop transitions, 19 changer transitions 1/53 dead transitions. [2021-03-25 14:29:08,284 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 53 transitions, 404 flow [2021-03-25 14:29:08,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:29:08,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:29:08,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 739 transitions. [2021-03-25 14:29:08,286 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7697916666666667 [2021-03-25 14:29:08,286 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 739 transitions. [2021-03-25 14:29:08,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 739 transitions. [2021-03-25 14:29:08,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:29:08,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 739 transitions. [2021-03-25 14:29:08,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.8) internal successors, (739), 5 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:08,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:08,292 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 192.0) internal successors, (1152), 6 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:08,292 INFO L185 Difference]: Start difference. First operand has 48 places, 38 transitions, 248 flow. Second operand 5 states and 739 transitions. [2021-03-25 14:29:08,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 53 transitions, 404 flow [2021-03-25 14:29:08,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 358 flow, removed 14 selfloop flow, removed 7 redundant places. [2021-03-25 14:29:08,296 INFO L241 Difference]: Finished difference. Result has 47 places, 49 transitions, 352 flow [2021-03-25 14:29:08,296 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=352, PETRI_PLACES=47, PETRI_TRANSITIONS=49} [2021-03-25 14:29:08,296 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2021-03-25 14:29:08,297 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:29:08,297 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 49 transitions, 352 flow [2021-03-25 14:29:08,297 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 49 transitions, 352 flow [2021-03-25 14:29:08,297 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 49 transitions, 352 flow [2021-03-25 14:29:08,314 INFO L129 PetriNetUnfolder]: 64/191 cut-off events. [2021-03-25 14:29:08,314 INFO L130 PetriNetUnfolder]: For 217/232 co-relation queries the response was YES. [2021-03-25 14:29:08,315 INFO L84 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 191 events. 64/191 cut-off events. For 217/232 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 959 event pairs, 8 based on Foata normal form. 10/196 useless extension candidates. Maximal degree in co-relation 624. Up to 72 conditions per place. [2021-03-25 14:29:08,316 INFO L142 LiptonReduction]: Number of co-enabled transitions 380 [2021-03-25 14:29:08,321 INFO L154 LiptonReduction]: Checked pairs total: 122 [2021-03-25 14:29:08,321 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:29:08,321 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 24 [2021-03-25 14:29:08,321 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 49 transitions, 352 flow [2021-03-25 14:29:08,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:08,322 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:29:08,322 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:29:08,322 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:29:08,322 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:29:08,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:29:08,323 INFO L82 PathProgramCache]: Analyzing trace with hash 964655432, now seen corresponding path program 1 times [2021-03-25 14:29:08,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:29:08,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157465758] [2021-03-25 14:29:08,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:29:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:29:08,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:08,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:29:08,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:08,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:29:08,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:08,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:29:08,392 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:29:08,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:29:08,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:29:08,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157465758] [2021-03-25 14:29:08,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:29:08,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:29:08,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337526072] [2021-03-25 14:29:08,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:29:08,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:29:08,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:29:08,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:29:08,407 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 192 [2021-03-25 14:29:08,407 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 49 transitions, 352 flow. Second operand has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:08,407 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:29:08,407 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 192 [2021-03-25 14:29:08,407 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:29:08,478 INFO L129 PetriNetUnfolder]: 82/234 cut-off events. [2021-03-25 14:29:08,478 INFO L130 PetriNetUnfolder]: For 386/528 co-relation queries the response was YES. [2021-03-25 14:29:08,479 INFO L84 FinitePrefix]: Finished finitePrefix Result has 890 conditions, 234 events. 82/234 cut-off events. For 386/528 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1209 event pairs, 8 based on Foata normal form. 31/258 useless extension candidates. Maximal degree in co-relation 868. Up to 80 conditions per place. [2021-03-25 14:29:08,480 INFO L132 encePairwiseOnDemand]: 183/192 looper letters, 8 selfloop transitions, 10 changer transitions 25/60 dead transitions. [2021-03-25 14:29:08,480 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 534 flow [2021-03-25 14:29:08,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:29:08,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:29:08,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 886 transitions. [2021-03-25 14:29:08,483 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7690972222222222 [2021-03-25 14:29:08,483 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 886 transitions. [2021-03-25 14:29:08,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 886 transitions. [2021-03-25 14:29:08,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:29:08,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 886 transitions. [2021-03-25 14:29:08,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 147.66666666666666) internal successors, (886), 6 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:08,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:08,489 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:08,489 INFO L185 Difference]: Start difference. First operand has 47 places, 49 transitions, 352 flow. Second operand 6 states and 886 transitions. [2021-03-25 14:29:08,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 60 transitions, 534 flow [2021-03-25 14:29:08,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 60 transitions, 532 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-03-25 14:29:08,493 INFO L241 Difference]: Finished difference. Result has 53 places, 33 transitions, 233 flow [2021-03-25 14:29:08,494 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=53, PETRI_TRANSITIONS=33} [2021-03-25 14:29:08,494 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2021-03-25 14:29:08,494 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:29:08,494 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 33 transitions, 233 flow [2021-03-25 14:29:08,494 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 33 transitions, 233 flow [2021-03-25 14:29:08,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 33 transitions, 233 flow [2021-03-25 14:29:08,505 INFO L129 PetriNetUnfolder]: 29/112 cut-off events. [2021-03-25 14:29:08,505 INFO L130 PetriNetUnfolder]: For 210/225 co-relation queries the response was YES. [2021-03-25 14:29:08,506 INFO L84 FinitePrefix]: Finished finitePrefix Result has 409 conditions, 112 events. 29/112 cut-off events. For 210/225 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 509 event pairs, 4 based on Foata normal form. 8/116 useless extension candidates. Maximal degree in co-relation 389. Up to 34 conditions per place. [2021-03-25 14:29:08,507 INFO L142 LiptonReduction]: Number of co-enabled transitions 230 [2021-03-25 14:29:08,577 INFO L154 LiptonReduction]: Checked pairs total: 94 [2021-03-25 14:29:08,578 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:29:08,578 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 84 [2021-03-25 14:29:08,578 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 32 transitions, 229 flow [2021-03-25 14:29:08,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:08,579 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:29:08,579 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:29:08,579 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:29:08,579 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:29:08,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:29:08,579 INFO L82 PathProgramCache]: Analyzing trace with hash -257465548, now seen corresponding path program 2 times [2021-03-25 14:29:08,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:29:08,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984440223] [2021-03-25 14:29:08,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:29:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:29:08,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:08,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:29:08,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:08,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:29:08,626 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-25 14:29:08,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:29:08,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:29:08,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984440223] [2021-03-25 14:29:08,638 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:29:08,638 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:29:08,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574440180] [2021-03-25 14:29:08,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:29:08,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:29:08,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:29:08,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:29:08,640 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 195 [2021-03-25 14:29:08,640 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 32 transitions, 229 flow. Second operand has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:08,640 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:29:08,640 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 195 [2021-03-25 14:29:08,641 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:29:08,674 INFO L129 PetriNetUnfolder]: 32/119 cut-off events. [2021-03-25 14:29:08,674 INFO L130 PetriNetUnfolder]: For 307/332 co-relation queries the response was YES. [2021-03-25 14:29:08,675 INFO L84 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 119 events. 32/119 cut-off events. For 307/332 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 534 event pairs, 4 based on Foata normal form. 15/132 useless extension candidates. Maximal degree in co-relation 453. Up to 36 conditions per place. [2021-03-25 14:29:08,675 INFO L132 encePairwiseOnDemand]: 188/195 looper letters, 4 selfloop transitions, 4 changer transitions 9/34 dead transitions. [2021-03-25 14:29:08,675 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 34 transitions, 273 flow [2021-03-25 14:29:08,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:29:08,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:29:08,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 605 transitions. [2021-03-25 14:29:08,677 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7756410256410257 [2021-03-25 14:29:08,677 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 605 transitions. [2021-03-25 14:29:08,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 605 transitions. [2021-03-25 14:29:08,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:29:08,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 605 transitions. [2021-03-25 14:29:08,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:08,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:08,681 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:08,681 INFO L185 Difference]: Start difference. First operand has 51 places, 32 transitions, 229 flow. Second operand 4 states and 605 transitions. [2021-03-25 14:29:08,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 34 transitions, 273 flow [2021-03-25 14:29:08,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 34 transitions, 227 flow, removed 7 selfloop flow, removed 7 redundant places. [2021-03-25 14:29:08,683 INFO L241 Difference]: Finished difference. Result has 48 places, 25 transitions, 140 flow [2021-03-25 14:29:08,684 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=48, PETRI_TRANSITIONS=25} [2021-03-25 14:29:08,684 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2021-03-25 14:29:08,684 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:29:08,684 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 25 transitions, 140 flow [2021-03-25 14:29:08,684 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 25 transitions, 140 flow [2021-03-25 14:29:08,685 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 25 transitions, 140 flow [2021-03-25 14:29:08,689 INFO L129 PetriNetUnfolder]: 6/36 cut-off events. [2021-03-25 14:29:08,689 INFO L130 PetriNetUnfolder]: For 74/86 co-relation queries the response was YES. [2021-03-25 14:29:08,689 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 36 events. 6/36 cut-off events. For 74/86 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 65 event pairs, 0 based on Foata normal form. 6/41 useless extension candidates. Maximal degree in co-relation 101. Up to 10 conditions per place. [2021-03-25 14:29:08,689 INFO L142 LiptonReduction]: Number of co-enabled transitions 76 [2021-03-25 14:29:09,497 WARN L205 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 183 [2021-03-25 14:29:09,762 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2021-03-25 14:29:10,963 WARN L205 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 307 DAG size of output: 263 [2021-03-25 14:29:11,486 WARN L205 SmtUtils]: Spent 521.00 ms on a formula simplification that was a NOOP. DAG size: 260 [2021-03-25 14:29:11,624 INFO L154 LiptonReduction]: Checked pairs total: 91 [2021-03-25 14:29:11,625 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 14:29:11,625 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2941 [2021-03-25 14:29:11,625 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 21 transitions, 126 flow [2021-03-25 14:29:11,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:11,626 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:29:11,626 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:29:11,626 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:29:11,626 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:29:11,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:29:11,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1050903865, now seen corresponding path program 1 times [2021-03-25 14:29:11,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:29:11,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235432676] [2021-03-25 14:29:11,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:29:11,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:29:11,651 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:29:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:29:11,707 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:29:11,745 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:29:11,746 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:29:11,747 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:29:11,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:29:11 BasicIcfg [2021-03-25 14:29:11,851 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:29:11,852 INFO L168 Benchmark]: Toolchain (without parser) took 14325.29 ms. Allocated memory was 255.9 MB in the beginning and 654.3 MB in the end (delta: 398.5 MB). Free memory was 234.1 MB in the beginning and 365.5 MB in the end (delta: -131.3 MB). Peak memory consumption was 267.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:29:11,852 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:29:11,853 INFO L168 Benchmark]: CACSL2BoogieTranslator took 511.20 ms. Allocated memory was 255.9 MB in the beginning and 356.5 MB in the end (delta: 100.7 MB). Free memory was 233.5 MB in the beginning and 317.4 MB in the end (delta: -83.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-25 14:29:11,853 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.01 ms. Allocated memory is still 356.5 MB. Free memory was 317.4 MB in the beginning and 315.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:29:11,853 INFO L168 Benchmark]: Boogie Preprocessor took 38.37 ms. Allocated memory is still 356.5 MB. Free memory was 314.5 MB in the beginning and 312.9 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:29:11,853 INFO L168 Benchmark]: RCFGBuilder took 1413.08 ms. Allocated memory is still 356.5 MB. Free memory was 312.4 MB in the beginning and 288.7 MB in the end (delta: 23.8 MB). Peak memory consumption was 44.0 MB. Max. memory is 16.0 GB. [2021-03-25 14:29:11,854 INFO L168 Benchmark]: TraceAbstraction took 12310.87 ms. Allocated memory was 356.5 MB in the beginning and 654.3 MB in the end (delta: 297.8 MB). Free memory was 288.7 MB in the beginning and 365.5 MB in the end (delta: -76.8 MB). Peak memory consumption was 221.0 MB. Max. memory is 16.0 GB. [2021-03-25 14:29:11,855 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.12 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 511.20 ms. Allocated memory was 255.9 MB in the beginning and 356.5 MB in the end (delta: 100.7 MB). Free memory was 233.5 MB in the beginning and 317.4 MB in the end (delta: -83.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 46.01 ms. Allocated memory is still 356.5 MB. Free memory was 317.4 MB in the beginning and 315.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 38.37 ms. Allocated memory is still 356.5 MB. Free memory was 314.5 MB in the beginning and 312.9 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 1413.08 ms. Allocated memory is still 356.5 MB. Free memory was 312.4 MB in the beginning and 288.7 MB in the end (delta: 23.8 MB). Peak memory consumption was 44.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 12310.87 ms. Allocated memory was 356.5 MB in the beginning and 654.3 MB in the end (delta: 297.8 MB). Free memory was 288.7 MB in the beginning and 365.5 MB in the end (delta: -76.8 MB). Peak memory consumption was 221.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2910.5ms, 109 PlacesBefore, 48 PlacesAfterwards, 101 TransitionsBefore, 39 TransitionsAfterwards, 1832 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 73 TotalNumberOfCompositions, 3136 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1791, positive: 1701, positive conditional: 0, positive unconditional: 1701, negative: 90, negative conditional: 0, negative unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1254, positive: 1221, positive conditional: 0, positive unconditional: 1221, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1254, positive: 1221, positive conditional: 0, positive unconditional: 1221, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1254, positive: 1218, positive conditional: 0, positive unconditional: 1218, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 36, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 320, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 300, negative conditional: 0, negative unconditional: 300, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1791, positive: 480, positive conditional: 0, positive unconditional: 480, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 1254, unknown conditional: 0, unknown unconditional: 1254] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 131, Positive conditional cache size: 0, Positive unconditional cache size: 131, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1881.2ms, 45 PlacesBefore, 33 PlacesAfterwards, 36 TransitionsBefore, 24 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 5 FixpointIterations, 10 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 1734 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 502, positive: 380, positive conditional: 0, positive unconditional: 380, negative: 122, negative conditional: 0, negative unconditional: 122, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 70, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 70, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 218, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 207, negative conditional: 0, negative unconditional: 207, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 502, positive: 331, positive conditional: 0, positive unconditional: 331, negative: 101, negative conditional: 0, negative unconditional: 101, unknown: 70, unknown conditional: 0, unknown unconditional: 70] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 147, Positive conditional cache size: 0, Positive unconditional cache size: 147, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 912.5ms, 39 PlacesBefore, 35 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 352 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 101, positive: 81, positive conditional: 0, positive unconditional: 81, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 101, positive: 79, positive conditional: 0, positive unconditional: 79, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 149, Positive conditional cache size: 0, Positive unconditional cache size: 149, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.8ms, 34 PlacesBefore, 34 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 175 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 41, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 41, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 151, Positive conditional cache size: 0, Positive unconditional cache size: 151, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22.7ms, 35 PlacesBefore, 35 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 310 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 213 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 39, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 39, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 151, Positive conditional cache size: 0, Positive unconditional cache size: 151, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.7ms, 40 PlacesBefore, 40 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 319 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 59, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 151, Positive conditional cache size: 0, Positive unconditional cache size: 151, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 60.7ms, 46 PlacesBefore, 46 PlacesAfterwards, 41 TransitionsBefore, 40 TransitionsAfterwards, 494 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 463 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 61, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 61, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 134, Positive conditional cache size: 0, Positive unconditional cache size: 134, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 37.0ms, 50 PlacesBefore, 50 PlacesAfterwards, 44 TransitionsBefore, 43 TransitionsAfterwards, 466 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 461 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, 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: 14, positive: 14, positive conditional: 0, positive unconditional: 14, 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: 59, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 137, Positive conditional cache size: 0, Positive unconditional cache size: 137, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 915.3ms, 52 PlacesBefore, 48 PlacesAfterwards, 41 TransitionsBefore, 38 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 488 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 68, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 123, Positive conditional cache size: 0, Positive unconditional cache size: 123, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.0ms, 47 PlacesBefore, 47 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 380 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 122 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 123, Positive conditional cache size: 0, Positive unconditional cache size: 123, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 83.4ms, 53 PlacesBefore, 51 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 94 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 55, positive conditional: 0, positive unconditional: 55, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 2, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 59, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 123, Positive conditional cache size: 0, Positive unconditional cache size: 123, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2940.3ms, 48 PlacesBefore, 43 PlacesAfterwards, 25 TransitionsBefore, 21 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 91 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 37, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 32, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 37, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 47, Positive conditional cache size: 0, Positive unconditional cache size: 47, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L843] 0 pthread_t t882; [L844] FCALL, FORK 0 pthread_create(&t882, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 pthread_t t883; [L846] FCALL, FORK 0 pthread_create(&t883, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t884; [L848] FCALL, FORK 0 pthread_create(&t884, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 3 a = 1 [L815] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 b = 1 [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L766] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L821] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L821] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L822] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L823] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L824] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L825] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L854] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L854] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L854] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L854] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L855] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L855] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L856] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L856] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L857] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L858] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 103 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 12075.7ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 901.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3011.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 94 SDtfs, 47 SDslu, 46 SDs, 0 SdLazy, 174 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 177.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 141.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=352occurred in iteration=9, InterpolantAutomatonStates: 51, 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: 45.2ms SsaConstructionTime, 324.0ms SatisfiabilityAnalysisTime, 566.9ms InterpolantComputationTime, 196 NumberOfCodeBlocks, 196 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 167 ConstructedInterpolants, 0 QuantifiedInterpolants, 979 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...