/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/mix042_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:18:08,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:18:08,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:18:08,283 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:18:08,283 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:18:08,286 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:18:08,288 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:18:08,293 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:18:08,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:18:08,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:18:08,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:18:08,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:18:08,302 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:18:08,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:18:08,305 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:18:08,307 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:18:08,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:18:08,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:18:08,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:18:08,319 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:18:08,321 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:18:08,322 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:18:08,323 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:18:08,324 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:18:08,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:18:08,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:18:08,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:18:08,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:18:08,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:18:08,333 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:18:08,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:18:08,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:18:08,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:18:08,336 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:18:08,337 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:18:08,337 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:18:08,338 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:18:08,338 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:18:08,338 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:18:08,339 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:18:08,340 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:18:08,344 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:18:08,378 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:18:08,378 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:18:08,382 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:18:08,382 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:18:08,382 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:18:08,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:18:08,383 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:18:08,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:18:08,383 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:18:08,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:18:08,384 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:18:08,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:18:08,385 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:18:08,385 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:18:08,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:18:08,385 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:18:08,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:18:08,385 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:18:08,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:18:08,386 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:18:08,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:18:08,386 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:18:08,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:18:08,387 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:18:08,387 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:18:08,387 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:18:08,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:18:08,387 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:18:08,387 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:18:08,388 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:18:08,388 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:18:08,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:18:08,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:18:08,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:18:08,697 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:18:08,697 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:18:08,698 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_pso.oepc.i [2021-03-26 00:18:08,762 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb7d5ebc2/9ad75fef686a49f88a5393bd9b46b6ff/FLAG467161113 [2021-03-26 00:18:09,319 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:18:09,319 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_pso.oepc.i [2021-03-26 00:18:09,333 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb7d5ebc2/9ad75fef686a49f88a5393bd9b46b6ff/FLAG467161113 [2021-03-26 00:18:09,559 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb7d5ebc2/9ad75fef686a49f88a5393bd9b46b6ff [2021-03-26 00:18:09,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:18:09,562 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:18:09,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:18:09,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:18:09,568 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:18:09,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:18:09" (1/1) ... [2021-03-26 00:18:09,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a413450 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:18:09, skipping insertion in model container [2021-03-26 00:18:09,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:18:09" (1/1) ... [2021-03-26 00:18:09,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:18:09,633 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:18:09,794 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/mix042_pso.oepc.i[949,962] [2021-03-26 00:18:10,059 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:18:10,067 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:18:10,076 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/mix042_pso.oepc.i[949,962] [2021-03-26 00:18:10,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:18:10,197 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:18:10,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:18:10 WrapperNode [2021-03-26 00:18:10,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:18:10,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:18:10,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:18:10,201 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:18:10,207 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:18:10" (1/1) ... [2021-03-26 00:18:10,240 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:18:10" (1/1) ... [2021-03-26 00:18:10,273 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:18:10,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:18:10,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:18:10,274 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:18:10,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:18:10" (1/1) ... [2021-03-26 00:18:10,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:18:10" (1/1) ... [2021-03-26 00:18:10,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:18:10" (1/1) ... [2021-03-26 00:18:10,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:18:10" (1/1) ... [2021-03-26 00:18:10,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:18:10" (1/1) ... [2021-03-26 00:18:10,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:18:10" (1/1) ... [2021-03-26 00:18:10,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:18:10" (1/1) ... [2021-03-26 00:18:10,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:18:10,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:18:10,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:18:10,340 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:18:10,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:18:10" (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:18:10,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:18:10,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:18:10,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:18:10,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:18:10,396 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:18:10,396 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:18:10,397 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:18:10,397 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:18:10,397 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:18:10,397 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:18:10,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:18:10,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:18:10,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:18:10,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:18:10,399 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:18:11,982 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:18:11,982 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:18:11,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:18:11 BoogieIcfgContainer [2021-03-26 00:18:11,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:18:11,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:18:11,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:18:11,987 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:18:11,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:18:09" (1/3) ... [2021-03-26 00:18:11,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d9bd7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:18:11, skipping insertion in model container [2021-03-26 00:18:11,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:18:10" (2/3) ... [2021-03-26 00:18:11,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d9bd7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:18:11, skipping insertion in model container [2021-03-26 00:18:11,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:18:11" (3/3) ... [2021-03-26 00:18:11,989 INFO L111 eAbstractionObserver]: Analyzing ICFG mix042_pso.oepc.i [2021-03-26 00:18:11,995 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:18:11,999 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:18:12,000 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:18:12,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,028 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,028 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,029 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,029 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,029 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,029 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,030 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,030 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,033 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,033 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,034 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,034 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,035 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,036 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,036 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,036 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,036 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,037 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,037 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,037 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,037 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,041 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,043 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,044 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,045 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,046 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,048 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,050 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,052 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,052 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,052 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,052 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,052 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,052 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,052 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,053 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,053 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,053 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,054 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,054 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,054 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,055 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,056 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,057 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,059 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,059 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,060 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:18:12,061 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:18:12,076 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 00:18:12,092 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:18:12,092 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:18:12,092 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:18:12,092 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:18:12,092 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:18:12,092 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:18:12,092 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:18:12,092 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:18:12,101 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 110 places, 102 transitions, 219 flow [2021-03-26 00:18:12,132 INFO L129 PetriNetUnfolder]: 2/99 cut-off events. [2021-03-26 00:18:12,132 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:18:12,135 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 99 events. 2/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2021-03-26 00:18:12,135 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 102 transitions, 219 flow [2021-03-26 00:18:12,139 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 99 transitions, 207 flow [2021-03-26 00:18:12,140 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:18:12,149 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 99 transitions, 207 flow [2021-03-26 00:18:12,152 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 99 transitions, 207 flow [2021-03-26 00:18:12,153 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 207 flow [2021-03-26 00:18:12,170 INFO L129 PetriNetUnfolder]: 2/99 cut-off events. [2021-03-26 00:18:12,170 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:18:12,171 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 99 events. 2/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2021-03-26 00:18:12,173 INFO L142 LiptonReduction]: Number of co-enabled transitions 1862 [2021-03-26 00:18:13,592 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:18:14,014 WARN L205 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:18:14,152 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:18:15,320 INFO L154 LiptonReduction]: Checked pairs total: 3648 [2021-03-26 00:18:15,320 INFO L156 LiptonReduction]: Total number of compositions: 72 [2021-03-26 00:18:15,322 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3183 [2021-03-26 00:18:15,331 INFO L129 PetriNetUnfolder]: 0/13 cut-off events. [2021-03-26 00:18:15,331 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:18:15,331 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:18:15,332 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:18:15,332 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:18:15,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:18:15,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1038582934, now seen corresponding path program 1 times [2021-03-26 00:18:15,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:18:15,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257517184] [2021-03-26 00:18:15,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:18:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:18:15,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:18:15,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:18:15,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:18:15,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:18:15,576 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:18:15,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257517184] [2021-03-26 00:18:15,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:18:15,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:18:15,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174104620] [2021-03-26 00:18:15,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:18:15,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:18:15,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:18:15,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:18:15,604 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 174 [2021-03-26 00:18:15,610 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 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:18:15,610 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:18:15,610 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 174 [2021-03-26 00:18:15,611 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:18:15,702 INFO L129 PetriNetUnfolder]: 49/162 cut-off events. [2021-03-26 00:18:15,702 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:18:15,704 INFO L84 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 162 events. 49/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 721 event pairs, 38 based on Foata normal form. 16/163 useless extension candidates. Maximal degree in co-relation 239. Up to 65 conditions per place. [2021-03-26 00:18:15,706 INFO L132 encePairwiseOnDemand]: 170/174 looper letters, 9 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2021-03-26 00:18:15,706 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 109 flow [2021-03-26 00:18:15,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:18:15,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:18:15,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2021-03-26 00:18:15,723 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8946360153256705 [2021-03-26 00:18:15,723 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2021-03-26 00:18:15,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2021-03-26 00:18:15,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:18:15,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2021-03-26 00:18:15,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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:18:15,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 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:18:15,742 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 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:18:15,743 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 467 transitions. [2021-03-26 00:18:15,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 109 flow [2021-03-26 00:18:15,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 106 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 00:18:15,747 INFO L241 Difference]: Finished difference. Result has 44 places, 35 transitions, 80 flow [2021-03-26 00:18:15,749 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2021-03-26 00:18:15,750 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2021-03-26 00:18:15,750 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:18:15,750 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 35 transitions, 80 flow [2021-03-26 00:18:15,751 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 80 flow [2021-03-26 00:18:15,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 80 flow [2021-03-26 00:18:15,759 INFO L129 PetriNetUnfolder]: 0/35 cut-off events. [2021-03-26 00:18:15,759 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:18:15,760 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:18:15,761 INFO L142 LiptonReduction]: Number of co-enabled transitions 342 [2021-03-26 00:18:16,935 INFO L154 LiptonReduction]: Checked pairs total: 1636 [2021-03-26 00:18:16,935 INFO L156 LiptonReduction]: Total number of compositions: 9 [2021-03-26 00:18:16,936 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1186 [2021-03-26 00:18:16,938 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 62 flow [2021-03-26 00:18:16,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 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:18:16,939 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:18:16,939 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:18:16,939 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:18:16,939 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:18:16,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:18:16,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1196975917, now seen corresponding path program 1 times [2021-03-26 00:18:16,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:18:16,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791249532] [2021-03-26 00:18:16,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:18:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:18:17,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:18:17,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:18:17,078 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:18:17,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:18:17,087 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:18:17,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:18:17,090 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:18:17,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791249532] [2021-03-26 00:18:17,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:18:17,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:18:17,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619362618] [2021-03-26 00:18:17,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:18:17,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:18:17,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:18:17,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:18:17,096 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 183 [2021-03-26 00:18:17,097 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 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:18:17,097 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:18:17,097 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 183 [2021-03-26 00:18:17,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:18:17,181 INFO L129 PetriNetUnfolder]: 82/230 cut-off events. [2021-03-26 00:18:17,182 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:18:17,182 INFO L84 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 230 events. 82/230 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1202 event pairs, 10 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 386. Up to 68 conditions per place. [2021-03-26 00:18:17,185 INFO L132 encePairwiseOnDemand]: 175/183 looper letters, 8 selfloop transitions, 6 changer transitions 12/42 dead transitions. [2021-03-26 00:18:17,185 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 146 flow [2021-03-26 00:18:17,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:18:17,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:18:17,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 727 transitions. [2021-03-26 00:18:17,188 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7945355191256831 [2021-03-26 00:18:17,188 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 727 transitions. [2021-03-26 00:18:17,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 727 transitions. [2021-03-26 00:18:17,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:18:17,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 727 transitions. [2021-03-26 00:18:17,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.4) internal successors, (727), 5 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:18:17,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 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:18:17,194 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 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:18:17,194 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 62 flow. Second operand 5 states and 727 transitions. [2021-03-26 00:18:17,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 146 flow [2021-03-26 00:18:17,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:18:17,196 INFO L241 Difference]: Finished difference. Result has 41 places, 30 transitions, 112 flow [2021-03-26 00:18:17,196 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2021-03-26 00:18:17,196 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -6 predicate places. [2021-03-26 00:18:17,197 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:18:17,197 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 30 transitions, 112 flow [2021-03-26 00:18:17,197 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 30 transitions, 112 flow [2021-03-26 00:18:17,197 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 30 transitions, 112 flow [2021-03-26 00:18:17,213 INFO L129 PetriNetUnfolder]: 38/144 cut-off events. [2021-03-26 00:18:17,213 INFO L130 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2021-03-26 00:18:17,214 INFO L84 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 144 events. 38/144 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 712 event pairs, 10 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 292. Up to 67 conditions per place. [2021-03-26 00:18:17,215 INFO L142 LiptonReduction]: Number of co-enabled transitions 316 [2021-03-26 00:18:17,999 WARN L205 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-26 00:18:18,138 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 00:18:18,464 WARN L205 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-26 00:18:18,609 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 00:18:18,614 INFO L154 LiptonReduction]: Checked pairs total: 756 [2021-03-26 00:18:18,614 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:18:18,614 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1417 [2021-03-26 00:18:18,615 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 108 flow [2021-03-26 00:18:18,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 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:18:18,616 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:18:18,616 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:18:18,616 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:18:18,616 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:18:18,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:18:18,617 INFO L82 PathProgramCache]: Analyzing trace with hash 413370635, now seen corresponding path program 1 times [2021-03-26 00:18:18,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:18:18,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098771189] [2021-03-26 00:18:18,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:18:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:18:18,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:18:18,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:18:18,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:18:18,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:18:18,670 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:18:18,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:18:18,683 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:18:18,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098771189] [2021-03-26 00:18:18,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:18:18,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:18:18,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539389300] [2021-03-26 00:18:18,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:18:18,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:18:18,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:18:18,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:18:18,686 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 185 [2021-03-26 00:18:18,687 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:18:18,687 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:18:18,687 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 185 [2021-03-26 00:18:18,687 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:18:18,726 INFO L129 PetriNetUnfolder]: 26/117 cut-off events. [2021-03-26 00:18:18,727 INFO L130 PetriNetUnfolder]: For 44/67 co-relation queries the response was YES. [2021-03-26 00:18:18,727 INFO L84 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 117 events. 26/117 cut-off events. For 44/67 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 522 event pairs, 5 based on Foata normal form. 4/119 useless extension candidates. Maximal degree in co-relation 291. Up to 49 conditions per place. [2021-03-26 00:18:18,730 INFO L132 encePairwiseOnDemand]: 179/185 looper letters, 9 selfloop transitions, 6 changer transitions 0/31 dead transitions. [2021-03-26 00:18:18,730 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 31 transitions, 156 flow [2021-03-26 00:18:18,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:18:18,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:18:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 588 transitions. [2021-03-26 00:18:18,732 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7945945945945946 [2021-03-26 00:18:18,732 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 588 transitions. [2021-03-26 00:18:18,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 588 transitions. [2021-03-26 00:18:18,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:18:18,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 588 transitions. [2021-03-26 00:18:18,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 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:18:18,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 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:18:18,736 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 185.0) internal successors, (925), 5 states have internal predecessors, (925), 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:18:18,736 INFO L185 Difference]: Start difference. First operand has 36 places, 28 transitions, 108 flow. Second operand 4 states and 588 transitions. [2021-03-26 00:18:18,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 31 transitions, 156 flow [2021-03-26 00:18:18,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 128 flow, removed 6 selfloop flow, removed 4 redundant places. [2021-03-26 00:18:18,740 INFO L241 Difference]: Finished difference. Result has 38 places, 30 transitions, 124 flow [2021-03-26 00:18:18,741 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2021-03-26 00:18:18,741 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -9 predicate places. [2021-03-26 00:18:18,741 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:18:18,741 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 30 transitions, 124 flow [2021-03-26 00:18:18,742 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 30 transitions, 124 flow [2021-03-26 00:18:18,742 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 30 transitions, 124 flow [2021-03-26 00:18:18,759 INFO L129 PetriNetUnfolder]: 26/123 cut-off events. [2021-03-26 00:18:18,760 INFO L130 PetriNetUnfolder]: For 42/44 co-relation queries the response was YES. [2021-03-26 00:18:18,762 INFO L84 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 123 events. 26/123 cut-off events. For 42/44 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 607 event pairs, 11 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 243. Up to 49 conditions per place. [2021-03-26 00:18:18,763 INFO L142 LiptonReduction]: Number of co-enabled transitions 338 [2021-03-26 00:18:18,784 INFO L154 LiptonReduction]: Checked pairs total: 280 [2021-03-26 00:18:18,785 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:18:18,785 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 44 [2021-03-26 00:18:18,785 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 124 flow [2021-03-26 00:18:18,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:18:18,786 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:18:18,786 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:18:18,786 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:18:18,786 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:18:18,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:18:18,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1214666907, now seen corresponding path program 1 times [2021-03-26 00:18:18,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:18:18,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842092201] [2021-03-26 00:18:18,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:18:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:18:18,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:18:18,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:18:18,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:18:18,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:18:18,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:18:18,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:18:18,860 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:18:18,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842092201] [2021-03-26 00:18:18,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:18:18,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:18:18,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554553371] [2021-03-26 00:18:18,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:18:18,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:18:18,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:18:18,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:18:18,863 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 185 [2021-03-26 00:18:18,864 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 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:18:18,864 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:18:18,864 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 185 [2021-03-26 00:18:18,864 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:18:18,925 INFO L129 PetriNetUnfolder]: 160/379 cut-off events. [2021-03-26 00:18:18,926 INFO L130 PetriNetUnfolder]: For 54/69 co-relation queries the response was YES. [2021-03-26 00:18:18,927 INFO L84 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 379 events. 160/379 cut-off events. For 54/69 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 2325 event pairs, 47 based on Foata normal form. 28/336 useless extension candidates. Maximal degree in co-relation 796. Up to 234 conditions per place. [2021-03-26 00:18:18,929 INFO L132 encePairwiseOnDemand]: 179/185 looper letters, 10 selfloop transitions, 8 changer transitions 0/41 dead transitions. [2021-03-26 00:18:18,929 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 182 flow [2021-03-26 00:18:18,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:18:18,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:18:18,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 785 transitions. [2021-03-26 00:18:18,931 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8486486486486486 [2021-03-26 00:18:18,931 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 785 transitions. [2021-03-26 00:18:18,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 785 transitions. [2021-03-26 00:18:18,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:18:18,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 785 transitions. [2021-03-26 00:18:18,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 157.0) internal successors, (785), 5 states have internal predecessors, (785), 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:18:18,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 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:18:18,936 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 185.0) internal successors, (1110), 6 states have internal predecessors, (1110), 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:18:18,936 INFO L185 Difference]: Start difference. First operand has 38 places, 30 transitions, 124 flow. Second operand 5 states and 785 transitions. [2021-03-26 00:18:18,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 182 flow [2021-03-26 00:18:18,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:18:18,938 INFO L241 Difference]: Finished difference. Result has 44 places, 37 transitions, 181 flow [2021-03-26 00:18:18,938 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2021-03-26 00:18:18,938 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2021-03-26 00:18:18,939 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:18:18,939 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 37 transitions, 181 flow [2021-03-26 00:18:18,939 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 37 transitions, 181 flow [2021-03-26 00:18:18,939 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 37 transitions, 181 flow [2021-03-26 00:18:18,991 INFO L129 PetriNetUnfolder]: 130/348 cut-off events. [2021-03-26 00:18:18,992 INFO L130 PetriNetUnfolder]: For 225/264 co-relation queries the response was YES. [2021-03-26 00:18:18,993 INFO L84 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 348 events. 130/348 cut-off events. For 225/264 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 2234 event pairs, 51 based on Foata normal form. 7/337 useless extension candidates. Maximal degree in co-relation 940. Up to 192 conditions per place. [2021-03-26 00:18:18,996 INFO L142 LiptonReduction]: Number of co-enabled transitions 480 [2021-03-26 00:18:19,176 INFO L154 LiptonReduction]: Checked pairs total: 700 [2021-03-26 00:18:19,177 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:18:19,177 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 238 [2021-03-26 00:18:19,179 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 175 flow [2021-03-26 00:18:19,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 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:18:19,179 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:18:19,180 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:18:19,180 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:18:19,180 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:18:19,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:18:19,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1205477513, now seen corresponding path program 1 times [2021-03-26 00:18:19,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:18:19,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573783333] [2021-03-26 00:18:19,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:18:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:18:19,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:18:19,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:18:19,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:18:19,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:18:19,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:18:19,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:18:19,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:18:19,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:18:19,323 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:18:19,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573783333] [2021-03-26 00:18:19,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:18:19,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:18:19,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297132013] [2021-03-26 00:18:19,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:18:19,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:18:19,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:18:19,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:18:19,333 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 185 [2021-03-26 00:18:19,334 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 153.8) internal successors, (769), 5 states have internal predecessors, (769), 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:18:19,334 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:18:19,334 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 185 [2021-03-26 00:18:19,334 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:18:19,412 INFO L129 PetriNetUnfolder]: 101/264 cut-off events. [2021-03-26 00:18:19,412 INFO L130 PetriNetUnfolder]: For 248/416 co-relation queries the response was YES. [2021-03-26 00:18:19,414 INFO L84 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 264 events. 101/264 cut-off events. For 248/416 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1433 event pairs, 6 based on Foata normal form. 53/293 useless extension candidates. Maximal degree in co-relation 854. Up to 154 conditions per place. [2021-03-26 00:18:19,415 INFO L132 encePairwiseOnDemand]: 179/185 looper letters, 8 selfloop transitions, 11 changer transitions 3/45 dead transitions. [2021-03-26 00:18:19,415 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 263 flow [2021-03-26 00:18:19,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:18:19,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:18:19,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 942 transitions. [2021-03-26 00:18:19,418 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8486486486486486 [2021-03-26 00:18:19,418 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 942 transitions. [2021-03-26 00:18:19,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 942 transitions. [2021-03-26 00:18:19,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:18:19,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 942 transitions. [2021-03-26 00:18:19,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 157.0) internal successors, (942), 6 states have internal predecessors, (942), 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:18:19,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 185.0) internal successors, (1295), 7 states have internal predecessors, (1295), 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:18:19,424 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 185.0) internal successors, (1295), 7 states have internal predecessors, (1295), 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:18:19,425 INFO L185 Difference]: Start difference. First operand has 44 places, 36 transitions, 175 flow. Second operand 6 states and 942 transitions. [2021-03-26 00:18:19,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 263 flow [2021-03-26 00:18:19,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 45 transitions, 257 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:18:19,429 INFO L241 Difference]: Finished difference. Result has 48 places, 40 transitions, 239 flow [2021-03-26 00:18:19,430 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=239, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2021-03-26 00:18:19,430 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 1 predicate places. [2021-03-26 00:18:19,430 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:18:19,430 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 40 transitions, 239 flow [2021-03-26 00:18:19,431 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 40 transitions, 239 flow [2021-03-26 00:18:19,431 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 40 transitions, 239 flow [2021-03-26 00:18:19,459 INFO L129 PetriNetUnfolder]: 58/211 cut-off events. [2021-03-26 00:18:19,459 INFO L130 PetriNetUnfolder]: For 386/421 co-relation queries the response was YES. [2021-03-26 00:18:19,460 INFO L84 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 211 events. 58/211 cut-off events. For 386/421 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1198 event pairs, 8 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 732. Up to 123 conditions per place. [2021-03-26 00:18:19,462 INFO L142 LiptonReduction]: Number of co-enabled transitions 472 [2021-03-26 00:18:19,472 INFO L154 LiptonReduction]: Checked pairs total: 669 [2021-03-26 00:18:19,472 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:18:19,472 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 42 [2021-03-26 00:18:19,474 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 231 flow [2021-03-26 00:18:19,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 153.8) internal successors, (769), 5 states have internal predecessors, (769), 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:18:19,475 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:18:19,475 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:18:19,475 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:18:19,475 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:18:19,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:18:19,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1967598855, now seen corresponding path program 1 times [2021-03-26 00:18:19,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:18:19,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83695740] [2021-03-26 00:18:19,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:18:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:18:19,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:18:19,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:18:19,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:18:19,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:18:19,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:18:19,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:18:19,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:18:19,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:18:19,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:18:19,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:18:19,596 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:18:19,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83695740] [2021-03-26 00:18:19,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:18:19,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:18:19,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39815360] [2021-03-26 00:18:19,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:18:19,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:18:19,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:18:19,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:18:19,599 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 185 [2021-03-26 00:18:19,600 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 231 flow. Second operand has 6 states, 6 states have (on average 153.83333333333334) internal successors, (923), 6 states have internal predecessors, (923), 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:18:19,600 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:18:19,600 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 185 [2021-03-26 00:18:19,600 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:18:19,670 INFO L129 PetriNetUnfolder]: 75/192 cut-off events. [2021-03-26 00:18:19,671 INFO L130 PetriNetUnfolder]: For 500/608 co-relation queries the response was YES. [2021-03-26 00:18:19,671 INFO L84 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 192 events. 75/192 cut-off events. For 500/608 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 912 event pairs, 0 based on Foata normal form. 37/207 useless extension candidates. Maximal degree in co-relation 717. Up to 104 conditions per place. [2021-03-26 00:18:19,672 INFO L132 encePairwiseOnDemand]: 179/185 looper letters, 5 selfloop transitions, 11 changer transitions 4/43 dead transitions. [2021-03-26 00:18:19,672 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 43 transitions, 277 flow [2021-03-26 00:18:19,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:18:19,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:18:19,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1093 transitions. [2021-03-26 00:18:19,675 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.844015444015444 [2021-03-26 00:18:19,675 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1093 transitions. [2021-03-26 00:18:19,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1093 transitions. [2021-03-26 00:18:19,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:18:19,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1093 transitions. [2021-03-26 00:18:19,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 156.14285714285714) internal successors, (1093), 7 states have internal predecessors, (1093), 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:18:19,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 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:18:19,681 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 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:18:19,681 INFO L185 Difference]: Start difference. First operand has 48 places, 39 transitions, 231 flow. Second operand 7 states and 1093 transitions. [2021-03-26 00:18:19,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 43 transitions, 277 flow [2021-03-26 00:18:19,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 43 transitions, 252 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-03-26 00:18:19,685 INFO L241 Difference]: Finished difference. Result has 51 places, 37 transitions, 218 flow [2021-03-26 00:18:19,685 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=218, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2021-03-26 00:18:19,685 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2021-03-26 00:18:19,685 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:18:19,685 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 37 transitions, 218 flow [2021-03-26 00:18:19,686 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 37 transitions, 218 flow [2021-03-26 00:18:19,686 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 37 transitions, 218 flow [2021-03-26 00:18:19,703 INFO L129 PetriNetUnfolder]: 30/126 cut-off events. [2021-03-26 00:18:19,703 INFO L130 PetriNetUnfolder]: For 183/187 co-relation queries the response was YES. [2021-03-26 00:18:19,703 INFO L84 FinitePrefix]: Finished finitePrefix Result has 426 conditions, 126 events. 30/126 cut-off events. For 183/187 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 572 event pairs, 4 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 406. Up to 39 conditions per place. [2021-03-26 00:18:19,704 INFO L142 LiptonReduction]: Number of co-enabled transitions 340 [2021-03-26 00:18:20,048 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-26 00:18:20,181 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-03-26 00:18:20,507 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 00:18:20,692 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 00:18:20,699 INFO L154 LiptonReduction]: Checked pairs total: 800 [2021-03-26 00:18:20,699 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:18:20,699 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1014 [2021-03-26 00:18:20,700 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 204 flow [2021-03-26 00:18:20,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 153.83333333333334) internal successors, (923), 6 states have internal predecessors, (923), 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:18:20,700 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:18:20,701 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:18:20,701 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:18:20,701 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:18:20,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:18:20,701 INFO L82 PathProgramCache]: Analyzing trace with hash -335031716, now seen corresponding path program 1 times [2021-03-26 00:18:20,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:18:20,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979938696] [2021-03-26 00:18:20,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:18:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:18:20,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:18:20,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:18:20,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:18:20,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:18:20,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:18:20,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:18:20,760 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:18:20,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979938696] [2021-03-26 00:18:20,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:18:20,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:18:20,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213203630] [2021-03-26 00:18:20,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:18:20,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:18:20,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:18:20,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:18:20,762 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 187 [2021-03-26 00:18:20,763 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 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:18:20,763 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:18:20,763 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 187 [2021-03-26 00:18:20,763 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:18:20,794 INFO L129 PetriNetUnfolder]: 46/155 cut-off events. [2021-03-26 00:18:20,794 INFO L130 PetriNetUnfolder]: For 748/785 co-relation queries the response was YES. [2021-03-26 00:18:20,795 INFO L84 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 155 events. 46/155 cut-off events. For 748/785 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 748 event pairs, 0 based on Foata normal form. 22/172 useless extension candidates. Maximal degree in co-relation 511. Up to 51 conditions per place. [2021-03-26 00:18:20,795 INFO L132 encePairwiseOnDemand]: 184/187 looper letters, 4 selfloop transitions, 1 changer transitions 4/36 dead transitions. [2021-03-26 00:18:20,795 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 36 transitions, 230 flow [2021-03-26 00:18:20,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:18:20,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:18:20,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 618 transitions. [2021-03-26 00:18:20,797 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8262032085561497 [2021-03-26 00:18:20,797 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 618 transitions. [2021-03-26 00:18:20,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 618 transitions. [2021-03-26 00:18:20,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:18:20,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 618 transitions. [2021-03-26 00:18:20,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 154.5) internal successors, (618), 4 states have internal predecessors, (618), 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:18:20,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:18:20,800 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:18:20,801 INFO L185 Difference]: Start difference. First operand has 47 places, 34 transitions, 204 flow. Second operand 4 states and 618 transitions. [2021-03-26 00:18:20,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 36 transitions, 230 flow [2021-03-26 00:18:20,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 36 transitions, 188 flow, removed 12 selfloop flow, removed 7 redundant places. [2021-03-26 00:18:20,803 INFO L241 Difference]: Finished difference. Result has 45 places, 32 transitions, 159 flow [2021-03-26 00:18:20,804 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2021-03-26 00:18:20,804 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2021-03-26 00:18:20,804 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:18:20,804 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 32 transitions, 159 flow [2021-03-26 00:18:20,804 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 32 transitions, 159 flow [2021-03-26 00:18:20,804 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 32 transitions, 159 flow [2021-03-26 00:18:20,814 INFO L129 PetriNetUnfolder]: 20/92 cut-off events. [2021-03-26 00:18:20,814 INFO L130 PetriNetUnfolder]: For 86/90 co-relation queries the response was YES. [2021-03-26 00:18:20,814 INFO L84 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 92 events. 20/92 cut-off events. For 86/90 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 380 event pairs, 2 based on Foata normal form. 3/92 useless extension candidates. Maximal degree in co-relation 228. Up to 22 conditions per place. [2021-03-26 00:18:20,815 INFO L142 LiptonReduction]: Number of co-enabled transitions 266 [2021-03-26 00:18:20,866 INFO L154 LiptonReduction]: Checked pairs total: 282 [2021-03-26 00:18:20,866 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:18:20,866 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 62 [2021-03-26 00:18:20,867 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 160 flow [2021-03-26 00:18:20,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 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:18:20,867 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:18:20,867 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:18:20,868 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:18:20,868 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:18:20,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:18:20,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1782866338, now seen corresponding path program 1 times [2021-03-26 00:18:20,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:18:20,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845210028] [2021-03-26 00:18:20,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:18:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:18:20,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:18:20,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:18:20,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:18:20,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:18:20,958 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 00:18:20,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:18:20,968 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:18:20,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845210028] [2021-03-26 00:18:20,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:18:20,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:18:20,970 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529743439] [2021-03-26 00:18:20,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:18:20,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:18:20,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:18:20,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:18:20,972 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 189 [2021-03-26 00:18:20,972 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:18:20,972 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:18:20,972 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 189 [2021-03-26 00:18:20,972 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:18:21,004 INFO L129 PetriNetUnfolder]: 23/94 cut-off events. [2021-03-26 00:18:21,004 INFO L130 PetriNetUnfolder]: For 211/234 co-relation queries the response was YES. [2021-03-26 00:18:21,004 INFO L84 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 94 events. 23/94 cut-off events. For 211/234 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 371 event pairs, 0 based on Foata normal form. 15/107 useless extension candidates. Maximal degree in co-relation 270. Up to 26 conditions per place. [2021-03-26 00:18:21,005 INFO L132 encePairwiseOnDemand]: 183/189 looper letters, 3 selfloop transitions, 4 changer transitions 7/33 dead transitions. [2021-03-26 00:18:21,005 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 33 transitions, 196 flow [2021-03-26 00:18:21,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:18:21,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:18:21,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 590 transitions. [2021-03-26 00:18:21,007 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7804232804232805 [2021-03-26 00:18:21,007 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 590 transitions. [2021-03-26 00:18:21,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 590 transitions. [2021-03-26 00:18:21,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:18:21,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 590 transitions. [2021-03-26 00:18:21,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.5) internal successors, (590), 4 states have internal predecessors, (590), 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:18:21,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 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:18:21,010 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 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:18:21,010 INFO L185 Difference]: Start difference. First operand has 43 places, 31 transitions, 160 flow. Second operand 4 states and 590 transitions. [2021-03-26 00:18:21,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 33 transitions, 196 flow [2021-03-26 00:18:21,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 188 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-26 00:18:21,015 INFO L241 Difference]: Finished difference. Result has 44 places, 26 transitions, 132 flow [2021-03-26 00:18:21,015 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=44, PETRI_TRANSITIONS=26} [2021-03-26 00:18:21,015 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2021-03-26 00:18:21,015 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:18:21,015 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 26 transitions, 132 flow [2021-03-26 00:18:21,015 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 26 transitions, 132 flow [2021-03-26 00:18:21,016 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 26 transitions, 132 flow [2021-03-26 00:18:21,020 INFO L129 PetriNetUnfolder]: 5/29 cut-off events. [2021-03-26 00:18:21,020 INFO L130 PetriNetUnfolder]: For 36/45 co-relation queries the response was YES. [2021-03-26 00:18:21,020 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 29 events. 5/29 cut-off events. For 36/45 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 3/31 useless extension candidates. Maximal degree in co-relation 70. Up to 8 conditions per place. [2021-03-26 00:18:21,020 INFO L142 LiptonReduction]: Number of co-enabled transitions 158 [2021-03-26 00:18:21,877 WARN L205 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 183 [2021-03-26 00:18:22,434 WARN L205 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 180 [2021-03-26 00:18:23,726 WARN L205 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 307 DAG size of output: 263 [2021-03-26 00:18:24,340 WARN L205 SmtUtils]: Spent 611.00 ms on a formula simplification that was a NOOP. DAG size: 260 [2021-03-26 00:18:24,344 INFO L154 LiptonReduction]: Checked pairs total: 278 [2021-03-26 00:18:24,344 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 00:18:24,345 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3330 [2021-03-26 00:18:24,345 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 23 transitions, 122 flow [2021-03-26 00:18:24,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:18:24,346 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:18:24,346 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:18:24,346 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:18:24,346 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:18:24,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:18:24,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1961788893, now seen corresponding path program 1 times [2021-03-26 00:18:24,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:18:24,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200638543] [2021-03-26 00:18:24,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:18:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:18:24,403 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:18:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:18:24,444 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:18:24,480 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:18:24,480 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:18:24,480 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:18:24,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:18:24 BasicIcfg [2021-03-26 00:18:24,584 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:18:24,585 INFO L168 Benchmark]: Toolchain (without parser) took 15023.12 ms. Allocated memory was 255.9 MB in the beginning and 534.8 MB in the end (delta: 278.9 MB). Free memory was 234.1 MB in the beginning and 359.1 MB in the end (delta: -125.1 MB). Peak memory consumption was 153.0 MB. Max. memory is 16.0 GB. [2021-03-26 00:18:24,586 INFO L168 Benchmark]: CDTParser took 0.49 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:18:24,586 INFO L168 Benchmark]: CACSL2BoogieTranslator took 636.76 ms. Allocated memory was 255.9 MB in the beginning and 362.8 MB in the end (delta: 107.0 MB). Free memory was 234.1 MB in the beginning and 322.3 MB in the end (delta: -88.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:18:24,588 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.79 ms. Allocated memory is still 362.8 MB. Free memory was 322.3 MB in the beginning and 319.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:18:24,590 INFO L168 Benchmark]: Boogie Preprocessor took 54.62 ms. Allocated memory is still 362.8 MB. Free memory was 319.8 MB in the beginning and 317.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:18:24,590 INFO L168 Benchmark]: RCFGBuilder took 1643.85 ms. Allocated memory is still 362.8 MB. Free memory was 317.3 MB in the beginning and 215.5 MB in the end (delta: 101.8 MB). Peak memory consumption was 105.3 MB. Max. memory is 16.0 GB. [2021-03-26 00:18:24,590 INFO L168 Benchmark]: TraceAbstraction took 12599.63 ms. Allocated memory was 362.8 MB in the beginning and 534.8 MB in the end (delta: 172.0 MB). Free memory was 215.5 MB in the beginning and 359.1 MB in the end (delta: -143.7 MB). Peak memory consumption was 28.3 MB. Max. memory is 16.0 GB. [2021-03-26 00:18:24,596 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.49 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 636.76 ms. Allocated memory was 255.9 MB in the beginning and 362.8 MB in the end (delta: 107.0 MB). Free memory was 234.1 MB in the beginning and 322.3 MB in the end (delta: -88.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 72.79 ms. Allocated memory is still 362.8 MB. Free memory was 322.3 MB in the beginning and 319.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 54.62 ms. Allocated memory is still 362.8 MB. Free memory was 319.8 MB in the beginning and 317.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1643.85 ms. Allocated memory is still 362.8 MB. Free memory was 317.3 MB in the beginning and 215.5 MB in the end (delta: 101.8 MB). Peak memory consumption was 105.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 12599.63 ms. Allocated memory was 362.8 MB in the beginning and 534.8 MB in the end (delta: 172.0 MB). Free memory was 215.5 MB in the beginning and 359.1 MB in the end (delta: -143.7 MB). Peak memory consumption was 28.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3168.5ms, 107 PlacesBefore, 47 PlacesAfterwards, 99 TransitionsBefore, 38 TransitionsAfterwards, 1862 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 72 TotalNumberOfCompositions, 3648 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1932, positive: 1828, positive conditional: 1828, positive unconditional: 0, negative: 104, negative conditional: 104, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1348, positive: 1310, positive conditional: 0, positive unconditional: 1310, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1348, positive: 1310, positive conditional: 0, positive unconditional: 1310, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1348, positive: 1303, positive conditional: 0, positive unconditional: 1303, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 45, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 577, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 558, negative conditional: 0, negative unconditional: 558, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1932, positive: 518, positive conditional: 518, positive unconditional: 0, negative: 66, negative conditional: 66, negative unconditional: 0, unknown: 1348, unknown conditional: 1348, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 81, Positive conditional cache size: 81, Positive unconditional cache size: 0, Negative cache size: 23, Negative conditional cache size: 23, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1184.6ms, 44 PlacesBefore, 35 PlacesAfterwards, 35 TransitionsBefore, 26 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 1636 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 454, positive: 348, positive conditional: 348, positive unconditional: 0, negative: 106, negative conditional: 106, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 94, positive: 78, positive conditional: 7, positive unconditional: 71, negative: 16, negative conditional: 1, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 94, positive: 78, positive conditional: 7, positive unconditional: 71, negative: 16, negative conditional: 1, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 94, positive: 72, positive conditional: 0, positive unconditional: 72, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 22, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 16, negative conditional: 1, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 245, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 218, negative conditional: 40, negative unconditional: 177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 454, positive: 270, positive conditional: 270, positive unconditional: 0, negative: 90, negative conditional: 90, negative unconditional: 0, unknown: 94, unknown conditional: 94, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 122, Positive conditional cache size: 122, Positive unconditional cache size: 0, Negative cache size: 31, Negative conditional cache size: 31, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1417.0ms, 41 PlacesBefore, 36 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 756 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 171, positive: 129, positive conditional: 129, positive unconditional: 0, negative: 42, negative conditional: 42, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 12, positive conditional: 5, positive unconditional: 7, 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: 15, positive: 12, positive conditional: 5, positive unconditional: 7, 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: 15, positive: 12, positive conditional: 0, positive unconditional: 12, 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: 119, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 119, negative conditional: 119, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 171, positive: 117, positive conditional: 117, positive unconditional: 0, negative: 39, negative conditional: 39, negative unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 134, Positive conditional cache size: 134, Positive unconditional cache size: 0, Negative cache size: 34, Negative conditional cache size: 34, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 42.7ms, 38 PlacesBefore, 38 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 338 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 280 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 68, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 12, positive conditional: 5, positive unconditional: 7, 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: 14, positive: 12, positive conditional: 5, positive unconditional: 7, 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: 14, positive: 12, positive conditional: 0, positive unconditional: 12, 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: 18, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68, positive: 41, positive conditional: 41, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 182, Positive cache size: 146, Positive conditional cache size: 146, Positive unconditional cache size: 0, Negative cache size: 36, Negative conditional cache size: 36, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 237.7ms, 44 PlacesBefore, 44 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 700 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 147, positive: 117, positive conditional: 117, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, positive: 34, positive conditional: 22, positive unconditional: 12, negative: 5, negative conditional: 3, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, positive: 34, positive conditional: 22, positive unconditional: 12, negative: 5, negative conditional: 3, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 39, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 3, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 164, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 164, negative conditional: 133, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 147, positive: 83, positive conditional: 83, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 39, unknown conditional: 39, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 150, Positive conditional cache size: 150, Positive unconditional cache size: 0, Negative cache size: 40, Negative conditional cache size: 40, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 41.8ms, 48 PlacesBefore, 48 PlacesAfterwards, 40 TransitionsBefore, 39 TransitionsAfterwards, 472 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 669 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 184, positive: 154, positive conditional: 154, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 44, positive: 44, positive conditional: 33, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 44, positive: 44, positive conditional: 33, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 44, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 184, positive: 110, positive conditional: 110, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 44, unknown conditional: 44, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 208, Positive cache size: 168, Positive conditional cache size: 168, Positive unconditional cache size: 0, Negative cache size: 40, Negative conditional cache size: 40, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1013.4ms, 51 PlacesBefore, 47 PlacesAfterwards, 37 TransitionsBefore, 34 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 800 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 218, positive: 173, positive conditional: 173, positive unconditional: 0, negative: 45, negative conditional: 45, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, positive: 22, positive conditional: 22, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, positive: 22, positive conditional: 22, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 218, positive: 151, positive conditional: 151, positive unconditional: 0, negative: 45, negative conditional: 45, negative unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 193, Positive cache size: 158, Positive conditional cache size: 158, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 62.0ms, 45 PlacesBefore, 43 PlacesAfterwards, 32 TransitionsBefore, 31 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 282 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 64, positive: 46, positive conditional: 46, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, positive: 18, positive conditional: 6, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 18, positive conditional: 6, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 64, positive: 28, positive conditional: 28, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 104, Positive conditional cache size: 104, Positive unconditional cache size: 0, Negative cache size: 28, Negative conditional cache size: 28, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3329.1ms, 44 PlacesBefore, 40 PlacesAfterwards, 26 TransitionsBefore, 23 TransitionsAfterwards, 158 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 278 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 68, positive: 41, positive conditional: 41, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, positive: 20, positive conditional: 16, positive unconditional: 4, 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: 21, positive: 20, positive conditional: 16, positive unconditional: 4, 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: 21, positive: 20, positive conditional: 0, positive unconditional: 20, 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: 36, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 21, unknown conditional: 21, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 41, Positive conditional cache size: 41, Positive unconditional cache size: 0, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool a$flush_delayed; [L719] 0 int a$mem_tmp; [L720] 0 _Bool a$r_buff0_thd0; [L721] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd2; [L723] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$read_delayed; [L729] 0 int *a$read_delayed_var; [L730] 0 int a$w_buff0; [L731] 0 _Bool a$w_buff0_used; [L732] 0 int a$w_buff1; [L733] 0 _Bool a$w_buff1_used; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t1111; [L844] FCALL, FORK 0 pthread_create(&t1111, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1112; [L846] FCALL, FORK 0 pthread_create(&t1112, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L776] 2 x = 1 [L779] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L847] 0 pthread_t t1113; [L848] FCALL, FORK 0 pthread_create(&t1113, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L796] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L799] 3 z = 1 [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L810] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0) [L810] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L811] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1) [L811] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L812] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used) [L812] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L813] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L814] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3) [L814] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L815] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=1] [L782] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L782] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L782] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L762] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L821] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L821] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L821] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L821] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L822] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L823] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L824] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L825] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L854] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L854] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L854] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L854] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L855] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L856] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L857] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L858] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L861] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 101 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 12392.2ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 661.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3235.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 51 SDtfs, 33 SDslu, 27 SDs, 0 SdLazy, 139 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 154.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 100.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=239occurred in iteration=5, InterpolantAutomatonStates: 38, 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: 30.7ms SsaConstructionTime, 365.1ms SatisfiabilityAnalysisTime, 489.6ms InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 529 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...