/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe002_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:34:05,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:34:05,170 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:34:05,198 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:34:05,198 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:34:05,199 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:34:05,200 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:34:05,202 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:34:05,203 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:34:05,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:34:05,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:34:05,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:34:05,206 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:34:05,207 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:34:05,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:34:05,209 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:34:05,209 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:34:05,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:34:05,212 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:34:05,213 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:34:05,214 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:34:05,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:34:05,220 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:34:05,221 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:34:05,228 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:34:05,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:34:05,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:34:05,230 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:34:05,230 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:34:05,231 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:34:05,231 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:34:05,232 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:34:05,233 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:34:05,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:34:05,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:34:05,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:34:05,235 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:34:05,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:34:05,236 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:34:05,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:34:05,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:34:05,242 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-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:34:05,268 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:34:05,268 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:34:05,270 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:34:05,270 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:34:05,270 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:34:05,270 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:34:05,271 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:34:05,271 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:34:05,271 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:34:05,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:34:05,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:34:05,272 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:34:05,272 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:34:05,272 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:34:05,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:34:05,272 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:34:05,272 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:34:05,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:34:05,273 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:34:05,273 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:34:05,273 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:34:05,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:34:05,273 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:34:05,274 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:34:05,274 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:34:05,274 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:34:05,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:34:05,274 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:34:05,274 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:34:05,275 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:34:05,275 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 00:34:05,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:34:05,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:34:05,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:34:05,571 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:34:05,572 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:34:05,573 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_pso.opt.i [2021-03-26 00:34:05,645 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea770c63b/217b22589e2448dca13a54b14dea3e9a/FLAGe516bc2d1 [2021-03-26 00:34:06,189 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:34:06,190 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_pso.opt.i [2021-03-26 00:34:06,207 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea770c63b/217b22589e2448dca13a54b14dea3e9a/FLAGe516bc2d1 [2021-03-26 00:34:06,635 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea770c63b/217b22589e2448dca13a54b14dea3e9a [2021-03-26 00:34:06,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:34:06,656 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:34:06,661 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:34:06,661 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:34:06,664 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:34:06,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:34:06" (1/1) ... [2021-03-26 00:34:06,669 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25aef6b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:34:06, skipping insertion in model container [2021-03-26 00:34:06,669 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:34:06" (1/1) ... [2021-03-26 00:34:06,675 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:34:06,720 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:34:06,872 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/safe002_pso.opt.i[992,1005] [2021-03-26 00:34:07,088 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:34:07,098 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:34:07,110 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/safe002_pso.opt.i[992,1005] [2021-03-26 00:34:07,173 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:34:07,247 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:34:07,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:34:07 WrapperNode [2021-03-26 00:34:07,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:34:07,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:34:07,255 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:34:07,255 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:34:07,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:34:07" (1/1) ... [2021-03-26 00:34:07,297 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:34:07" (1/1) ... [2021-03-26 00:34:07,327 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:34:07,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:34:07,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:34:07,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:34:07,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:34:07" (1/1) ... [2021-03-26 00:34:07,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:34:07" (1/1) ... [2021-03-26 00:34:07,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:34:07" (1/1) ... [2021-03-26 00:34:07,357 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:34:07" (1/1) ... [2021-03-26 00:34:07,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:34:07" (1/1) ... [2021-03-26 00:34:07,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:34:07" (1/1) ... [2021-03-26 00:34:07,368 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:34:07" (1/1) ... [2021-03-26 00:34:07,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:34:07,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:34:07,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:34:07,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:34:07,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:34:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:34:07,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:34:07,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:34:07,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:34:07,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:34:07,467 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:34:07,467 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:34:07,468 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:34:07,468 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:34:07,468 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:34:07,468 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:34:07,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:34:07,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:34:07,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:34:07,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:34:07,470 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:34:09,137 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:34:09,137 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:34:09,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:34:09 BoogieIcfgContainer [2021-03-26 00:34:09,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:34:09,143 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:34:09,143 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:34:09,146 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:34:09,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:34:06" (1/3) ... [2021-03-26 00:34:09,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378b36a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:34:09, skipping insertion in model container [2021-03-26 00:34:09,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:34:07" (2/3) ... [2021-03-26 00:34:09,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@378b36a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:34:09, skipping insertion in model container [2021-03-26 00:34:09,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:34:09" (3/3) ... [2021-03-26 00:34:09,149 INFO L111 eAbstractionObserver]: Analyzing ICFG safe002_pso.opt.i [2021-03-26 00:34:09,155 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:34:09,159 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:34:09,159 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:34:09,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,200 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,200 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,201 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,201 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,219 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,219 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,219 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,219 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,219 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,221 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,225 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,225 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,225 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,231 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,234 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,234 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,234 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,234 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,239 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,240 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,243 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,243 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,243 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,244 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,244 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,246 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,246 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:34:09,248 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:34:09,263 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 00:34:09,293 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:34:09,293 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:34:09,293 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:34:09,293 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:34:09,293 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:34:09,293 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:34:09,293 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:34:09,293 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:34:09,306 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 00:34:09,350 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 00:34:09,350 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:34:09,363 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-26 00:34:09,364 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 00:34:09,369 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-03-26 00:34:09,370 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:34:09,384 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 00:34:09,387 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 00:34:09,390 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-03-26 00:34:09,418 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 00:34:09,419 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:34:09,419 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-26 00:34:09,423 INFO L142 LiptonReduction]: Number of co-enabled transitions 1586 [2021-03-26 00:34:10,437 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:34:10,841 WARN L205 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-26 00:34:10,977 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 00:34:12,135 INFO L154 LiptonReduction]: Checked pairs total: 2041 [2021-03-26 00:34:12,135 INFO L156 LiptonReduction]: Total number of compositions: 63 [2021-03-26 00:34:12,137 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2768 [2021-03-26 00:34:12,156 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-03-26 00:34:12,156 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:34:12,156 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:34:12,158 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:34:12,158 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:34:12,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:34:12,171 INFO L82 PathProgramCache]: Analyzing trace with hash -101320376, now seen corresponding path program 1 times [2021-03-26 00:34:12,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:34:12,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026785252] [2021-03-26 00:34:12,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:34:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:34:12,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:34:12,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:34:12,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:34:12,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:34:12,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:34:12,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026785252] [2021-03-26 00:34:12,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:34:12,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:34:12,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069937722] [2021-03-26 00:34:12,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:34:12,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:34:12,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:34:12,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:34:12,392 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 160 [2021-03-26 00:34:12,398 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:12,398 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:34:12,398 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 160 [2021-03-26 00:34:12,399 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:34:12,479 INFO L129 PetriNetUnfolder]: 29/139 cut-off events. [2021-03-26 00:34:12,479 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:34:12,481 INFO L84 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 139 events. 29/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 588 event pairs, 15 based on Foata normal form. 9/132 useless extension candidates. Maximal degree in co-relation 185. Up to 41 conditions per place. [2021-03-26 00:34:12,484 INFO L132 encePairwiseOnDemand]: 156/160 looper letters, 7 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2021-03-26 00:34:12,484 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 37 transitions, 101 flow [2021-03-26 00:34:12,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:34:12,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:34:12,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2021-03-26 00:34:12,506 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9125 [2021-03-26 00:34:12,507 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2021-03-26 00:34:12,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2021-03-26 00:34:12,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:34:12,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2021-03-26 00:34:12,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:12,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:12,534 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:12,535 INFO L185 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 438 transitions. [2021-03-26 00:34:12,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 37 transitions, 101 flow [2021-03-26 00:34:12,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 98 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 00:34:12,540 INFO L241 Difference]: Finished difference. Result has 43 places, 34 transitions, 78 flow [2021-03-26 00:34:12,541 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2021-03-26 00:34:12,542 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2021-03-26 00:34:12,542 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:34:12,542 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 34 transitions, 78 flow [2021-03-26 00:34:12,543 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 34 transitions, 78 flow [2021-03-26 00:34:12,544 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 78 flow [2021-03-26 00:34:12,551 INFO L129 PetriNetUnfolder]: 0/34 cut-off events. [2021-03-26 00:34:12,551 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:34:12,552 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 34 events. 0/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:34:12,553 INFO L142 LiptonReduction]: Number of co-enabled transitions 318 [2021-03-26 00:34:13,722 INFO L154 LiptonReduction]: Checked pairs total: 1207 [2021-03-26 00:34:13,722 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-26 00:34:13,722 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1180 [2021-03-26 00:34:13,724 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-26 00:34:13,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:13,725 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:34:13,725 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:34:13,725 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:34:13,725 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:34:13,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:34:13,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1636459505, now seen corresponding path program 1 times [2021-03-26 00:34:13,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:34:13,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455349223] [2021-03-26 00:34:13,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:34:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:34:13,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:34:13,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:34:13,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:34:13,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:34:13,891 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:34:13,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:34:13,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:34:13,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:34:13,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:34:13,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455349223] [2021-03-26 00:34:13,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:34:13,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:34:13,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071997952] [2021-03-26 00:34:13,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:34:13,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:34:13,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:34:13,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:34:13,913 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 171 [2021-03-26 00:34:13,914 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:13,915 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:34:13,915 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 171 [2021-03-26 00:34:13,915 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:34:14,010 INFO L129 PetriNetUnfolder]: 79/223 cut-off events. [2021-03-26 00:34:14,010 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:34:14,013 INFO L84 FinitePrefix]: Finished finitePrefix Result has 382 conditions, 223 events. 79/223 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1135 event pairs, 2 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 371. Up to 48 conditions per place. [2021-03-26 00:34:14,014 INFO L132 encePairwiseOnDemand]: 163/171 looper letters, 9 selfloop transitions, 6 changer transitions 16/45 dead transitions. [2021-03-26 00:34:14,014 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 45 transitions, 160 flow [2021-03-26 00:34:14,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:34:14,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:34:14,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 956 transitions. [2021-03-26 00:34:14,021 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7986633249791144 [2021-03-26 00:34:14,022 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 956 transitions. [2021-03-26 00:34:14,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 956 transitions. [2021-03-26 00:34:14,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:34:14,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 956 transitions. [2021-03-26 00:34:14,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.57142857142858) internal successors, (956), 7 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:14,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 171.0) internal successors, (1368), 8 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:14,029 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 171.0) internal successors, (1368), 8 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:14,029 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 7 states and 956 transitions. [2021-03-26 00:34:14,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 45 transitions, 160 flow [2021-03-26 00:34:14,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:34:14,030 INFO L241 Difference]: Finished difference. Result has 42 places, 26 transitions, 102 flow [2021-03-26 00:34:14,031 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=102, PETRI_PLACES=42, PETRI_TRANSITIONS=26} [2021-03-26 00:34:14,031 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2021-03-26 00:34:14,031 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:34:14,031 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 26 transitions, 102 flow [2021-03-26 00:34:14,032 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 26 transitions, 102 flow [2021-03-26 00:34:14,033 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 26 transitions, 102 flow [2021-03-26 00:34:14,052 INFO L129 PetriNetUnfolder]: 30/111 cut-off events. [2021-03-26 00:34:14,052 INFO L130 PetriNetUnfolder]: For 42/45 co-relation queries the response was YES. [2021-03-26 00:34:14,053 INFO L84 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 111 events. 30/111 cut-off events. For 42/45 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 480 event pairs, 13 based on Foata normal form. 1/104 useless extension candidates. Maximal degree in co-relation 244. Up to 53 conditions per place. [2021-03-26 00:34:14,056 INFO L142 LiptonReduction]: Number of co-enabled transitions 242 [2021-03-26 00:34:14,427 WARN L205 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-26 00:34:14,551 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 00:34:14,861 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-26 00:34:14,987 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-26 00:34:15,091 INFO L154 LiptonReduction]: Checked pairs total: 340 [2021-03-26 00:34:15,092 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:34:15,092 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1061 [2021-03-26 00:34:15,093 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 100 flow [2021-03-26 00:34:15,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:15,094 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:34:15,094 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:34:15,094 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:34:15,094 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:34:15,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:34:15,095 INFO L82 PathProgramCache]: Analyzing trace with hash -443536654, now seen corresponding path program 1 times [2021-03-26 00:34:15,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:34:15,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329066252] [2021-03-26 00:34:15,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:34:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:34:15,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:34:15,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:34:15,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:34:15,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:34:15,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:34:15,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:34:15,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:34:15,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329066252] [2021-03-26 00:34:15,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:34:15,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:34:15,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720219425] [2021-03-26 00:34:15,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:34:15,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:34:15,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:34:15,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:34:15,196 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 172 [2021-03-26 00:34:15,197 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:15,197 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:34:15,197 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 172 [2021-03-26 00:34:15,197 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:34:15,231 INFO L129 PetriNetUnfolder]: 25/118 cut-off events. [2021-03-26 00:34:15,231 INFO L130 PetriNetUnfolder]: For 120/196 co-relation queries the response was YES. [2021-03-26 00:34:15,232 INFO L84 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 118 events. 25/118 cut-off events. For 120/196 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 585 event pairs, 5 based on Foata normal form. 10/123 useless extension candidates. Maximal degree in co-relation 304. Up to 46 conditions per place. [2021-03-26 00:34:15,233 INFO L132 encePairwiseOnDemand]: 167/172 looper letters, 9 selfloop transitions, 5 changer transitions 5/35 dead transitions. [2021-03-26 00:34:15,234 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 35 transitions, 198 flow [2021-03-26 00:34:15,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:34:15,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:34:15,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions. [2021-03-26 00:34:15,236 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8415697674418605 [2021-03-26 00:34:15,236 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 579 transitions. [2021-03-26 00:34:15,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions. [2021-03-26 00:34:15,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:34:15,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions. [2021-03-26 00:34:15,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:15,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:15,240 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:15,240 INFO L185 Difference]: Start difference. First operand has 36 places, 25 transitions, 100 flow. Second operand 4 states and 579 transitions. [2021-03-26 00:34:15,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 35 transitions, 198 flow [2021-03-26 00:34:15,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 35 transitions, 180 flow, removed 7 selfloop flow, removed 3 redundant places. [2021-03-26 00:34:15,244 INFO L241 Difference]: Finished difference. Result has 38 places, 26 transitions, 123 flow [2021-03-26 00:34:15,244 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2021-03-26 00:34:15,244 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -8 predicate places. [2021-03-26 00:34:15,244 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:34:15,245 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 26 transitions, 123 flow [2021-03-26 00:34:15,245 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 26 transitions, 123 flow [2021-03-26 00:34:15,245 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 26 transitions, 123 flow [2021-03-26 00:34:15,254 INFO L129 PetriNetUnfolder]: 13/70 cut-off events. [2021-03-26 00:34:15,254 INFO L130 PetriNetUnfolder]: For 54/62 co-relation queries the response was YES. [2021-03-26 00:34:15,255 INFO L84 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 70 events. 13/70 cut-off events. For 54/62 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 264 event pairs, 6 based on Foata normal form. 1/70 useless extension candidates. Maximal degree in co-relation 171. Up to 30 conditions per place. [2021-03-26 00:34:15,256 INFO L142 LiptonReduction]: Number of co-enabled transitions 224 [2021-03-26 00:34:15,294 INFO L154 LiptonReduction]: Checked pairs total: 192 [2021-03-26 00:34:15,294 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:34:15,294 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 50 [2021-03-26 00:34:15,295 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 123 flow [2021-03-26 00:34:15,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:15,295 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:34:15,296 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:34:15,296 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:34:15,296 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:34:15,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:34:15,296 INFO L82 PathProgramCache]: Analyzing trace with hash -444987940, now seen corresponding path program 1 times [2021-03-26 00:34:15,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:34:15,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084919390] [2021-03-26 00:34:15,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:34:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:34:15,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:34:15,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:34:15,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:34:15,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:34:15,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:34:15,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084919390] [2021-03-26 00:34:15,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:34:15,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:34:15,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035103314] [2021-03-26 00:34:15,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:34:15,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:34:15,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:34:15,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:34:15,378 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 172 [2021-03-26 00:34:15,379 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:15,379 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:34:15,379 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 172 [2021-03-26 00:34:15,379 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:34:15,413 INFO L129 PetriNetUnfolder]: 13/75 cut-off events. [2021-03-26 00:34:15,413 INFO L130 PetriNetUnfolder]: For 120/141 co-relation queries the response was YES. [2021-03-26 00:34:15,413 INFO L84 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 75 events. 13/75 cut-off events. For 120/141 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 331 event pairs, 2 based on Foata normal form. 8/82 useless extension candidates. Maximal degree in co-relation 211. Up to 33 conditions per place. [2021-03-26 00:34:15,413 INFO L132 encePairwiseOnDemand]: 167/172 looper letters, 6 selfloop transitions, 3 changer transitions 6/31 dead transitions. [2021-03-26 00:34:15,414 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 31 transitions, 188 flow [2021-03-26 00:34:15,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:34:15,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:34:15,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 576 transitions. [2021-03-26 00:34:15,416 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8372093023255814 [2021-03-26 00:34:15,416 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 576 transitions. [2021-03-26 00:34:15,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 576 transitions. [2021-03-26 00:34:15,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:34:15,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 576 transitions. [2021-03-26 00:34:15,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:15,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:15,421 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:15,421 INFO L185 Difference]: Start difference. First operand has 38 places, 26 transitions, 123 flow. Second operand 4 states and 576 transitions. [2021-03-26 00:34:15,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 31 transitions, 188 flow [2021-03-26 00:34:15,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 176 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:34:15,425 INFO L241 Difference]: Finished difference. Result has 40 places, 24 transitions, 107 flow [2021-03-26 00:34:15,425 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=107, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2021-03-26 00:34:15,425 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -6 predicate places. [2021-03-26 00:34:15,425 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:34:15,425 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 24 transitions, 107 flow [2021-03-26 00:34:15,426 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 24 transitions, 107 flow [2021-03-26 00:34:15,426 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 24 transitions, 107 flow [2021-03-26 00:34:15,432 INFO L129 PetriNetUnfolder]: 9/42 cut-off events. [2021-03-26 00:34:15,432 INFO L130 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2021-03-26 00:34:15,433 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 42 events. 9/42 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 107 event pairs, 3 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 110. Up to 21 conditions per place. [2021-03-26 00:34:15,433 INFO L142 LiptonReduction]: Number of co-enabled transitions 180 [2021-03-26 00:34:15,606 INFO L154 LiptonReduction]: Checked pairs total: 208 [2021-03-26 00:34:15,607 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:34:15,607 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 182 [2021-03-26 00:34:15,608 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 23 transitions, 109 flow [2021-03-26 00:34:15,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:15,609 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:34:15,609 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:34:15,609 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:34:15,609 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:34:15,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:34:15,610 INFO L82 PathProgramCache]: Analyzing trace with hash 865293219, now seen corresponding path program 1 times [2021-03-26 00:34:15,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:34:15,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550386] [2021-03-26 00:34:15,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:34:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:34:15,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:34:15,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:34:15,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:34:15,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:34:15,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:34:15,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:34:15,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:34:15,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550386] [2021-03-26 00:34:15,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:34:15,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:34:15,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764510757] [2021-03-26 00:34:15,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:34:15,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:34:15,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:34:15,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:34:15,684 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 174 [2021-03-26 00:34:15,685 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 23 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:15,685 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:34:15,685 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 174 [2021-03-26 00:34:15,685 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:34:15,717 INFO L129 PetriNetUnfolder]: 5/40 cut-off events. [2021-03-26 00:34:15,718 INFO L130 PetriNetUnfolder]: For 113/149 co-relation queries the response was YES. [2021-03-26 00:34:15,718 INFO L84 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 40 events. 5/40 cut-off events. For 113/149 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 127 event pairs, 2 based on Foata normal form. 9/48 useless extension candidates. Maximal degree in co-relation 117. Up to 17 conditions per place. [2021-03-26 00:34:15,718 INFO L132 encePairwiseOnDemand]: 169/174 looper letters, 3 selfloop transitions, 2 changer transitions 8/26 dead transitions. [2021-03-26 00:34:15,718 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 26 transitions, 156 flow [2021-03-26 00:34:15,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:34:15,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:34:15,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 717 transitions. [2021-03-26 00:34:15,720 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8241379310344827 [2021-03-26 00:34:15,720 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 717 transitions. [2021-03-26 00:34:15,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 717 transitions. [2021-03-26 00:34:15,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:34:15,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 717 transitions. [2021-03-26 00:34:15,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.4) internal successors, (717), 5 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:15,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:15,727 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:15,727 INFO L185 Difference]: Start difference. First operand has 39 places, 23 transitions, 109 flow. Second operand 5 states and 717 transitions. [2021-03-26 00:34:15,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 26 transitions, 156 flow [2021-03-26 00:34:15,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 26 transitions, 124 flow, removed 4 selfloop flow, removed 6 redundant places. [2021-03-26 00:34:15,731 INFO L241 Difference]: Finished difference. Result has 40 places, 18 transitions, 76 flow [2021-03-26 00:34:15,731 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=76, PETRI_PLACES=40, PETRI_TRANSITIONS=18} [2021-03-26 00:34:15,731 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -6 predicate places. [2021-03-26 00:34:15,731 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:34:15,731 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 18 transitions, 76 flow [2021-03-26 00:34:15,731 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 18 transitions, 76 flow [2021-03-26 00:34:15,732 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 18 transitions, 76 flow [2021-03-26 00:34:15,735 INFO L129 PetriNetUnfolder]: 1/21 cut-off events. [2021-03-26 00:34:15,735 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-03-26 00:34:15,736 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 21 events. 1/21 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 1 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 48. Up to 7 conditions per place. [2021-03-26 00:34:15,736 INFO L142 LiptonReduction]: Number of co-enabled transitions 94 [2021-03-26 00:34:15,763 INFO L154 LiptonReduction]: Checked pairs total: 84 [2021-03-26 00:34:15,763 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:34:15,763 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 32 [2021-03-26 00:34:15,765 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 18 transitions, 76 flow [2021-03-26 00:34:15,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:15,765 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:34:15,765 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:34:15,766 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:34:15,766 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:34:15,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:34:15,766 INFO L82 PathProgramCache]: Analyzing trace with hash 357247172, now seen corresponding path program 1 times [2021-03-26 00:34:15,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:34:15,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047734840] [2021-03-26 00:34:15,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:34:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:34:15,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:34:15,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:34:15,825 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:34:15,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:34:15,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:34:15,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:34:15,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:34:15,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047734840] [2021-03-26 00:34:15,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:34:15,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:34:15,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695317607] [2021-03-26 00:34:15,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:34:15,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:34:15,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:34:15,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:34:15,834 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 174 [2021-03-26 00:34:15,835 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 18 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:15,835 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:34:15,835 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 174 [2021-03-26 00:34:15,835 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:34:15,911 INFO L129 PetriNetUnfolder]: 34/85 cut-off events. [2021-03-26 00:34:15,911 INFO L130 PetriNetUnfolder]: For 170/174 co-relation queries the response was YES. [2021-03-26 00:34:15,918 INFO L84 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 85 events. 34/85 cut-off events. For 170/174 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 311 event pairs, 17 based on Foata normal form. 8/89 useless extension candidates. Maximal degree in co-relation 222. Up to 48 conditions per place. [2021-03-26 00:34:15,920 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 5 selfloop transitions, 4 changer transitions 7/28 dead transitions. [2021-03-26 00:34:15,921 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 28 transitions, 128 flow [2021-03-26 00:34:15,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:34:15,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:34:15,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 733 transitions. [2021-03-26 00:34:15,923 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8425287356321839 [2021-03-26 00:34:15,923 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 733 transitions. [2021-03-26 00:34:15,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 733 transitions. [2021-03-26 00:34:15,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:34:15,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 733 transitions. [2021-03-26 00:34:15,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.6) internal successors, (733), 5 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:15,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:15,929 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:15,929 INFO L185 Difference]: Start difference. First operand has 35 places, 18 transitions, 76 flow. Second operand 5 states and 733 transitions. [2021-03-26 00:34:15,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 28 transitions, 128 flow [2021-03-26 00:34:15,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 28 transitions, 114 flow, removed 4 selfloop flow, removed 5 redundant places. [2021-03-26 00:34:15,936 INFO L241 Difference]: Finished difference. Result has 37 places, 21 transitions, 98 flow [2021-03-26 00:34:15,936 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=98, PETRI_PLACES=37, PETRI_TRANSITIONS=21} [2021-03-26 00:34:15,936 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -9 predicate places. [2021-03-26 00:34:15,936 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:34:15,937 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 21 transitions, 98 flow [2021-03-26 00:34:15,937 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 21 transitions, 98 flow [2021-03-26 00:34:15,937 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 21 transitions, 98 flow [2021-03-26 00:34:15,947 INFO L129 PetriNetUnfolder]: 30/73 cut-off events. [2021-03-26 00:34:15,947 INFO L130 PetriNetUnfolder]: For 68/71 co-relation queries the response was YES. [2021-03-26 00:34:15,947 INFO L84 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 73 events. 30/73 cut-off events. For 68/71 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 227 event pairs, 18 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 205. Up to 42 conditions per place. [2021-03-26 00:34:15,948 INFO L142 LiptonReduction]: Number of co-enabled transitions 88 [2021-03-26 00:34:16,052 INFO L154 LiptonReduction]: Checked pairs total: 64 [2021-03-26 00:34:16,053 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:34:16,053 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 117 [2021-03-26 00:34:16,054 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 21 transitions, 98 flow [2021-03-26 00:34:16,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:16,054 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:34:16,054 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:34:16,054 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:34:16,055 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:34:16,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:34:16,055 INFO L82 PathProgramCache]: Analyzing trace with hash 2050832293, now seen corresponding path program 1 times [2021-03-26 00:34:16,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:34:16,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036297375] [2021-03-26 00:34:16,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:34:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:34:16,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:34:16,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:34:16,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:34:16,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:34:16,145 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:34:16,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:34:16,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:34:16,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:34:16,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:34:16,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036297375] [2021-03-26 00:34:16,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:34:16,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:34:16,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134792526] [2021-03-26 00:34:16,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:34:16,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:34:16,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:34:16,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:34:16,161 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 174 [2021-03-26 00:34:16,162 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 21 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:16,162 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:34:16,162 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 174 [2021-03-26 00:34:16,162 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:34:16,214 INFO L129 PetriNetUnfolder]: 18/57 cut-off events. [2021-03-26 00:34:16,215 INFO L130 PetriNetUnfolder]: For 61/70 co-relation queries the response was YES. [2021-03-26 00:34:16,215 INFO L84 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 57 events. 18/57 cut-off events. For 61/70 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 4 based on Foata normal form. 12/68 useless extension candidates. Maximal degree in co-relation 193. Up to 36 conditions per place. [2021-03-26 00:34:16,215 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 5 selfloop transitions, 7 changer transitions 7/31 dead transitions. [2021-03-26 00:34:16,216 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 194 flow [2021-03-26 00:34:16,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:34:16,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:34:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 879 transitions. [2021-03-26 00:34:16,219 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8419540229885057 [2021-03-26 00:34:16,219 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 879 transitions. [2021-03-26 00:34:16,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 879 transitions. [2021-03-26 00:34:16,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:34:16,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 879 transitions. [2021-03-26 00:34:16,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 146.5) internal successors, (879), 6 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:16,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:16,224 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 174.0) internal successors, (1218), 7 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:16,224 INFO L185 Difference]: Start difference. First operand has 35 places, 21 transitions, 98 flow. Second operand 6 states and 879 transitions. [2021-03-26 00:34:16,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 194 flow [2021-03-26 00:34:16,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 31 transitions, 182 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-03-26 00:34:16,227 INFO L241 Difference]: Finished difference. Result has 40 places, 24 transitions, 142 flow [2021-03-26 00:34:16,227 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=142, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2021-03-26 00:34:16,227 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -6 predicate places. [2021-03-26 00:34:16,227 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:34:16,227 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 24 transitions, 142 flow [2021-03-26 00:34:16,228 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 24 transitions, 142 flow [2021-03-26 00:34:16,228 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 24 transitions, 142 flow [2021-03-26 00:34:16,235 INFO L129 PetriNetUnfolder]: 13/45 cut-off events. [2021-03-26 00:34:16,235 INFO L130 PetriNetUnfolder]: For 74/76 co-relation queries the response was YES. [2021-03-26 00:34:16,235 INFO L84 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 45 events. 13/45 cut-off events. For 74/76 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 91 event pairs, 3 based on Foata normal form. 2/46 useless extension candidates. Maximal degree in co-relation 154. Up to 24 conditions per place. [2021-03-26 00:34:16,236 INFO L142 LiptonReduction]: Number of co-enabled transitions 84 [2021-03-26 00:34:16,294 INFO L154 LiptonReduction]: Checked pairs total: 72 [2021-03-26 00:34:16,294 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:34:16,295 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 68 [2021-03-26 00:34:16,295 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 24 transitions, 142 flow [2021-03-26 00:34:16,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:16,296 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:34:16,296 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:34:16,296 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:34:16,296 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:34:16,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:34:16,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1065279414, now seen corresponding path program 1 times [2021-03-26 00:34:16,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:34:16,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490745647] [2021-03-26 00:34:16,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:34:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:34:16,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:34:16,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:34:16,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:34:16,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:34:16,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:34:16,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:34:16,394 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:34:16,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:34:16,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:34:16,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:34:16,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:34:16,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490745647] [2021-03-26 00:34:16,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:34:16,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:34:16,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405115452] [2021-03-26 00:34:16,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:34:16,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:34:16,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:34:16,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:34:16,407 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 174 [2021-03-26 00:34:16,408 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 24 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 143.83333333333334) internal successors, (863), 6 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:16,408 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:34:16,408 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 174 [2021-03-26 00:34:16,408 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:34:16,471 INFO L129 PetriNetUnfolder]: 7/33 cut-off events. [2021-03-26 00:34:16,472 INFO L130 PetriNetUnfolder]: For 89/105 co-relation queries the response was YES. [2021-03-26 00:34:16,472 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 33 events. 7/33 cut-off events. For 89/105 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 12/44 useless extension candidates. Maximal degree in co-relation 128. Up to 20 conditions per place. [2021-03-26 00:34:16,472 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 2 selfloop transitions, 10 changer transitions 4/28 dead transitions. [2021-03-26 00:34:16,472 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 28 transitions, 210 flow [2021-03-26 00:34:16,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:34:16,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:34:16,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1019 transitions. [2021-03-26 00:34:16,475 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8366174055829229 [2021-03-26 00:34:16,475 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1019 transitions. [2021-03-26 00:34:16,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1019 transitions. [2021-03-26 00:34:16,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:34:16,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1019 transitions. [2021-03-26 00:34:16,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 145.57142857142858) internal successors, (1019), 7 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:16,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 174.0) internal successors, (1392), 8 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:16,480 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 174.0) internal successors, (1392), 8 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:16,480 INFO L185 Difference]: Start difference. First operand has 38 places, 24 transitions, 142 flow. Second operand 7 states and 1019 transitions. [2021-03-26 00:34:16,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 28 transitions, 210 flow [2021-03-26 00:34:16,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 28 transitions, 166 flow, removed 17 selfloop flow, removed 6 redundant places. [2021-03-26 00:34:16,482 INFO L241 Difference]: Finished difference. Result has 41 places, 24 transitions, 136 flow [2021-03-26 00:34:16,482 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=41, PETRI_TRANSITIONS=24} [2021-03-26 00:34:16,482 INFO L343 CegarLoopForPetriNet]: 46 programPoint places, -5 predicate places. [2021-03-26 00:34:16,482 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:34:16,483 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 24 transitions, 136 flow [2021-03-26 00:34:16,483 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 24 transitions, 136 flow [2021-03-26 00:34:16,483 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 24 transitions, 136 flow [2021-03-26 00:34:16,489 INFO L129 PetriNetUnfolder]: 5/27 cut-off events. [2021-03-26 00:34:16,490 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-03-26 00:34:16,490 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 27 events. 5/27 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 75. Up to 11 conditions per place. [2021-03-26 00:34:16,490 INFO L142 LiptonReduction]: Number of co-enabled transitions 58 [2021-03-26 00:34:16,836 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 00:34:16,969 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-26 00:34:17,673 WARN L205 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 00:34:17,966 WARN L205 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 00:34:19,192 WARN L205 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 00:34:19,854 WARN L205 SmtUtils]: Spent 660.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 00:34:20,001 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:34:20,107 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:34:20,269 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 00:34:20,427 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 00:34:20,429 INFO L154 LiptonReduction]: Checked pairs total: 154 [2021-03-26 00:34:20,429 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:34:20,430 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3948 [2021-03-26 00:34:20,430 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 21 transitions, 130 flow [2021-03-26 00:34:20,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 143.83333333333334) internal successors, (863), 6 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:34:20,431 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:34:20,431 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:34:20,431 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:34:20,431 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:34:20,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:34:20,431 INFO L82 PathProgramCache]: Analyzing trace with hash 628743621, now seen corresponding path program 1 times [2021-03-26 00:34:20,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:34:20,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883071077] [2021-03-26 00:34:20,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:34:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:34:20,468 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:34:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:34:20,539 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:34:20,581 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:34:20,581 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:34:20,581 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:34:20,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:34:20 BasicIcfg [2021-03-26 00:34:20,676 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:34:20,676 INFO L168 Benchmark]: Toolchain (without parser) took 14020.28 ms. Allocated memory was 255.9 MB in the beginning and 526.4 MB in the end (delta: 270.5 MB). Free memory was 234.2 MB in the beginning and 316.0 MB in the end (delta: -81.8 MB). Peak memory consumption was 188.7 MB. Max. memory is 16.0 GB. [2021-03-26 00:34:20,677 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:34:20,677 INFO L168 Benchmark]: CACSL2BoogieTranslator took 593.24 ms. Allocated memory was 255.9 MB in the beginning and 364.9 MB in the end (delta: 109.1 MB). Free memory was 233.8 MB in the beginning and 324.2 MB in the end (delta: -90.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:34:20,677 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.72 ms. Allocated memory is still 364.9 MB. Free memory was 324.2 MB in the beginning and 321.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:34:20,678 INFO L168 Benchmark]: Boogie Preprocessor took 61.72 ms. Allocated memory is still 364.9 MB. Free memory was 321.6 MB in the beginning and 319.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:34:20,678 INFO L168 Benchmark]: RCFGBuilder took 1751.55 ms. Allocated memory is still 364.9 MB. Free memory was 319.5 MB in the beginning and 330.7 MB in the end (delta: -11.2 MB). Peak memory consumption was 70.0 MB. Max. memory is 16.0 GB. [2021-03-26 00:34:20,678 INFO L168 Benchmark]: TraceAbstraction took 11532.60 ms. Allocated memory was 364.9 MB in the beginning and 526.4 MB in the end (delta: 161.5 MB). Free memory was 330.7 MB in the beginning and 316.0 MB in the end (delta: 14.7 MB). Peak memory consumption was 177.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:34:20,680 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.19 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 593.24 ms. Allocated memory was 255.9 MB in the beginning and 364.9 MB in the end (delta: 109.1 MB). Free memory was 233.8 MB in the beginning and 324.2 MB in the end (delta: -90.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 72.72 ms. Allocated memory is still 364.9 MB. Free memory was 324.2 MB in the beginning and 321.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 61.72 ms. Allocated memory is still 364.9 MB. Free memory was 321.6 MB in the beginning and 319.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1751.55 ms. Allocated memory is still 364.9 MB. Free memory was 319.5 MB in the beginning and 330.7 MB in the end (delta: -11.2 MB). Peak memory consumption was 70.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 11532.60 ms. Allocated memory was 364.9 MB in the beginning and 526.4 MB in the end (delta: 161.5 MB). Free memory was 330.7 MB in the beginning and 316.0 MB in the end (delta: 14.7 MB). Peak memory consumption was 177.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2748.9ms, 102 PlacesBefore, 46 PlacesAfterwards, 94 TransitionsBefore, 37 TransitionsAfterwards, 1586 CoEnabledTransitionPairs, 4 FixpointIterations, 28 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 63 TotalNumberOfCompositions, 2041 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1140, positive: 1093, positive conditional: 1093, positive unconditional: 0, negative: 47, negative conditional: 47, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 901, positive: 869, positive conditional: 0, positive unconditional: 869, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 901, positive: 869, positive conditional: 0, positive unconditional: 869, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 901, positive: 865, positive conditional: 0, positive unconditional: 865, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 36, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 316, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 298, negative conditional: 0, negative unconditional: 298, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1140, positive: 224, positive conditional: 224, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 901, unknown conditional: 901, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 69, Positive cache size: 51, Positive conditional cache size: 51, Positive unconditional cache size: 0, Negative cache size: 18, Negative conditional cache size: 18, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1178.6ms, 43 PlacesBefore, 33 PlacesAfterwards, 34 TransitionsBefore, 24 TransitionsAfterwards, 318 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 1207 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 337, positive: 256, positive conditional: 256, positive unconditional: 0, negative: 81, negative conditional: 81, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 91, positive: 81, positive conditional: 13, positive unconditional: 68, negative: 10, negative conditional: 1, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 91, positive: 81, positive conditional: 13, positive unconditional: 68, negative: 10, negative conditional: 1, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 91, positive: 81, positive conditional: 0, positive unconditional: 81, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 10, negative conditional: 1, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 153, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 153, negative conditional: 45, negative unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 337, positive: 175, positive conditional: 175, positive unconditional: 0, negative: 71, negative conditional: 71, negative unconditional: 0, unknown: 91, unknown conditional: 91, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 76, Positive conditional cache size: 76, Positive unconditional cache size: 0, Negative cache size: 24, Negative conditional cache size: 24, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1059.8ms, 42 PlacesBefore, 36 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 340 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 87, positive: 65, positive conditional: 65, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, positive: 19, positive conditional: 11, positive unconditional: 8, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, positive: 19, positive conditional: 11, positive unconditional: 8, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 159, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 159, negative conditional: 159, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 87, positive: 46, positive conditional: 46, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 95, Positive conditional cache size: 95, Positive unconditional cache size: 0, Negative cache size: 27, Negative conditional cache size: 27, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 48.7ms, 38 PlacesBefore, 38 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 224 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 192 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 66, positive: 52, positive conditional: 52, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, positive: 21, positive conditional: 11, positive unconditional: 10, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, positive: 21, positive conditional: 11, positive unconditional: 10, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 35, negative conditional: 4, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 66, positive: 31, positive conditional: 31, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 23, unknown conditional: 23, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 116, Positive conditional cache size: 116, Positive unconditional cache size: 0, Negative cache size: 29, Negative conditional cache size: 29, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 181.1ms, 40 PlacesBefore, 39 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 208 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 42, positive conditional: 42, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, positive: 17, positive conditional: 14, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 17, positive conditional: 14, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 17, positive conditional: 0, positive unconditional: 17, 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: 11, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 59, positive: 25, positive conditional: 25, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 70, Positive conditional cache size: 70, Positive unconditional cache size: 0, Negative cache size: 16, Negative conditional cache size: 16, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.8ms, 40 PlacesBefore, 35 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 84 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 72, Positive conditional cache size: 72, Positive unconditional cache size: 0, Negative cache size: 18, Negative conditional cache size: 18, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 115.8ms, 37 PlacesBefore, 35 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 64 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 29, positive: 23, positive conditional: 23, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, positive: 17, positive conditional: 6, positive unconditional: 11, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, positive: 17, positive conditional: 6, positive unconditional: 11, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 102, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 102, negative conditional: 0, negative unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 29, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 20, unknown conditional: 20, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 89, Positive conditional cache size: 89, Positive unconditional cache size: 0, Negative cache size: 21, Negative conditional cache size: 21, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 66.7ms, 40 PlacesBefore, 38 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 84 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 72 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 22, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 6, 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: 9, positive: 8, positive conditional: 6, 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: 9, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 57, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 97, Positive conditional cache size: 97, Positive unconditional cache size: 0, Negative cache size: 22, Negative conditional cache size: 22, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3946.7ms, 41 PlacesBefore, 36 PlacesAfterwards, 24 TransitionsBefore, 21 TransitionsAfterwards, 58 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 154 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 71, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, positive: 15, positive conditional: 0, positive unconditional: 15, 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: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 39, negative conditional: 39, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 71, positive: 35, positive conditional: 35, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 51, Positive conditional cache size: 51, Positive unconditional cache size: 0, Negative cache size: 6, Negative conditional cache size: 6, Negative unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L829] 0 pthread_t t1834; [L830] FCALL, FORK 0 pthread_create(&t1834, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L831] 0 pthread_t t1835; [L832] FCALL, FORK 0 pthread_create(&t1835, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L833] 0 pthread_t t1836; [L834] FCALL, FORK 0 pthread_create(&t1836, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] 3 __unbuffered_p2_EAX = y [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EBX = x [L759] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L811] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 3 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L840] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L840] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L840] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L840] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L842] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L847] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 11293.9ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 673.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2858.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 40 SDtfs, 37 SDslu, 30 SDs, 0 SdLazy, 150 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 145.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 133.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=7, InterpolantAutomatonStates: 41, 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: 44.2ms SsaConstructionTime, 276.0ms SatisfiabilityAnalysisTime, 488.1ms InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 102 ConstructedInterpolants, 0 QuantifiedInterpolants, 408 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...