/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe007_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:50:42,237 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:50:42,240 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:50:42,281 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:50:42,282 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:50:42,285 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:50:42,288 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:50:42,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:50:42,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:50:42,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:50:42,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:50:42,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:50:42,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:50:42,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:50:42,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:50:42,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:50:42,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:50:42,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:50:42,314 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:50:42,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:50:42,328 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:50:42,330 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:50:42,331 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:50:42,333 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:50:42,340 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:50:42,340 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:50:42,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:50:42,342 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:50:42,343 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:50:42,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:50:42,344 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:50:42,345 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:50:42,347 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:50:42,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:50:42,348 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:50:42,349 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:50:42,349 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:50:42,349 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:50:42,350 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:50:42,350 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:50:42,351 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:50:42,355 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2021-03-25 14:50:42,394 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:50:42,394 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:50:42,398 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:50:42,398 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:50:42,398 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:50:42,398 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:50:42,399 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:50:42,399 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:50:42,399 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:50:42,400 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:50:42,400 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:50:42,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:50:42,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:50:42,401 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:50:42,401 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:50:42,401 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:50:42,401 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:50:42,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:50:42,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:50:42,402 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:50:42,402 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:50:42,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:50:42,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:50:42,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:50:42,403 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:50:42,403 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:50:42,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:50:42,404 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:50:42,404 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:50:42,404 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 14:50:42,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:50:42,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:50:42,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:50:42,770 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:50:42,770 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:50:42,771 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe007_rmo.oepc.i [2021-03-25 14:50:42,845 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2fc41cb0/79d3cdcc40d8466298fb63610a8e0d86/FLAG55e4b07e1 [2021-03-25 14:50:43,461 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:50:43,462 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe007_rmo.oepc.i [2021-03-25 14:50:43,481 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2fc41cb0/79d3cdcc40d8466298fb63610a8e0d86/FLAG55e4b07e1 [2021-03-25 14:50:43,741 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2fc41cb0/79d3cdcc40d8466298fb63610a8e0d86 [2021-03-25 14:50:43,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:50:43,746 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:50:43,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:50:43,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:50:43,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:50:43,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:50:43" (1/1) ... [2021-03-25 14:50:43,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f3dd8c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:50:43, skipping insertion in model container [2021-03-25 14:50:43,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:50:43" (1/1) ... [2021-03-25 14:50:43,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:50:43,813 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:50:43,955 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/safe007_rmo.oepc.i[993,1006] [2021-03-25 14:50:44,165 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:50:44,177 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:50:44,188 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/safe007_rmo.oepc.i[993,1006] [2021-03-25 14:50:44,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:50:44,289 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:50:44,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:50:44 WrapperNode [2021-03-25 14:50:44,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:50:44,291 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:50:44,291 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:50:44,291 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:50:44,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:50:44" (1/1) ... [2021-03-25 14:50:44,312 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:50:44" (1/1) ... [2021-03-25 14:50:44,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:50:44,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:50:44,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:50:44,335 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:50:44,342 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:50:44" (1/1) ... [2021-03-25 14:50:44,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:50:44" (1/1) ... [2021-03-25 14:50:44,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:50:44" (1/1) ... [2021-03-25 14:50:44,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:50:44" (1/1) ... [2021-03-25 14:50:44,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:50:44" (1/1) ... [2021-03-25 14:50:44,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:50:44" (1/1) ... [2021-03-25 14:50:44,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:50:44" (1/1) ... [2021-03-25 14:50:44,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:50:44,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:50:44,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:50:44,368 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:50:44,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:50:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:50:44,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-25 14:50:44,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:50:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:50:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:50:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:50:44,449 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:50:44,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:50:44,450 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:50:44,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:50:44,450 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:50:44,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:50:44,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:50:44,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:50:44,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:50:44,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:50:44,453 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 14:50:46,049 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:50:46,049 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-03-25 14:50:46,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:50:46 BoogieIcfgContainer [2021-03-25 14:50:46,053 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:50:46,054 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:50:46,055 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:50:46,057 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:50:46,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:50:43" (1/3) ... [2021-03-25 14:50:46,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102aeba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:50:46, skipping insertion in model container [2021-03-25 14:50:46,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:50:44" (2/3) ... [2021-03-25 14:50:46,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102aeba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:50:46, skipping insertion in model container [2021-03-25 14:50:46,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:50:46" (3/3) ... [2021-03-25 14:50:46,060 INFO L111 eAbstractionObserver]: Analyzing ICFG safe007_rmo.oepc.i [2021-03-25 14:50:46,066 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:50:46,070 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-25 14:50:46,071 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:50:46,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,116 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,116 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,117 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,117 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,117 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,117 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,118 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,119 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,119 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,119 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,120 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,121 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,122 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,123 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,134 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,134 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,135 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,135 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,136 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,136 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,136 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,136 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,137 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,137 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,137 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,137 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,137 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,137 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,137 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,137 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,139 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,139 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,139 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,139 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,139 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,141 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,142 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,144 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,144 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,146 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,147 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:50:46,150 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:50:46,167 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-03-25 14:50:46,185 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:50:46,186 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:50:46,186 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:50:46,186 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:50:46,186 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:50:46,186 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:50:46,186 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:50:46,186 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:50:46,196 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2021-03-25 14:50:46,232 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-03-25 14:50:46,233 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:50:46,236 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2021-03-25 14:50:46,236 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2021-03-25 14:50:46,240 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 99 transitions, 207 flow [2021-03-25 14:50:46,242 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:50:46,253 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 99 transitions, 207 flow [2021-03-25 14:50:46,256 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 99 transitions, 207 flow [2021-03-25 14:50:46,257 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 99 transitions, 207 flow [2021-03-25 14:50:46,273 INFO L129 PetriNetUnfolder]: 1/99 cut-off events. [2021-03-25 14:50:46,274 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:50:46,274 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 99 events. 1/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-25 14:50:46,276 INFO L142 LiptonReduction]: Number of co-enabled transitions 954 [2021-03-25 14:50:48,808 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2021-03-25 14:50:49,258 WARN L205 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93 [2021-03-25 14:50:49,427 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-03-25 14:50:50,209 WARN L205 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 197 [2021-03-25 14:50:50,551 WARN L205 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 195 [2021-03-25 14:50:51,903 WARN L205 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 322 DAG size of output: 277 [2021-03-25 14:50:52,501 WARN L205 SmtUtils]: Spent 590.00 ms on a formula simplification that was a NOOP. DAG size: 274 [2021-03-25 14:50:54,112 INFO L154 LiptonReduction]: Checked pairs total: 1446 [2021-03-25 14:50:54,112 INFO L156 LiptonReduction]: Total number of compositions: 62 [2021-03-25 14:50:54,114 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7873 [2021-03-25 14:50:54,127 INFO L129 PetriNetUnfolder]: 1/38 cut-off events. [2021-03-25 14:50:54,127 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:50:54,127 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:50:54,128 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:50:54,128 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:50:54,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:50:54,133 INFO L82 PathProgramCache]: Analyzing trace with hash 529741085, now seen corresponding path program 1 times [2021-03-25 14:50:54,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:50:54,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066068611] [2021-03-25 14:50:54,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:50:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:50:54,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:50:54,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:50:54,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:50:54,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:50:54,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:50:54,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066068611] [2021-03-25 14:50:54,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:50:54,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:50:54,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642285147] [2021-03-25 14:50:54,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:50:54,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:50:54,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:50:54,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:50:54,552 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 176 [2021-03-25 14:50:54,558 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:54,558 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:50:54,558 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 176 [2021-03-25 14:50:54,559 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:50:54,592 INFO L129 PetriNetUnfolder]: 0/37 cut-off events. [2021-03-25 14:50:54,592 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:50:54,593 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 3/40 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:50:54,594 INFO L132 encePairwiseOnDemand]: 172/176 looper letters, 1 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2021-03-25 14:50:54,594 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 37 transitions, 89 flow [2021-03-25 14:50:54,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:50:54,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:50:54,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2021-03-25 14:50:54,612 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9431818181818182 [2021-03-25 14:50:54,613 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 498 transitions. [2021-03-25 14:50:54,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 498 transitions. [2021-03-25 14:50:54,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:50:54,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 498 transitions. [2021-03-25 14:50:54,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:54,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:54,633 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:54,635 INFO L185 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 498 transitions. [2021-03-25 14:50:54,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 37 transitions, 89 flow [2021-03-25 14:50:54,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 37 transitions, 86 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 14:50:54,641 INFO L241 Difference]: Finished difference. Result has 47 places, 37 transitions, 88 flow [2021-03-25 14:50:54,643 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2021-03-25 14:50:54,644 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2021-03-25 14:50:54,644 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:50:54,644 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 37 transitions, 88 flow [2021-03-25 14:50:54,646 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 37 transitions, 88 flow [2021-03-25 14:50:54,646 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 37 transitions, 88 flow [2021-03-25 14:50:54,653 INFO L129 PetriNetUnfolder]: 0/37 cut-off events. [2021-03-25 14:50:54,653 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 14:50:54,653 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 37 events. 0/37 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:50:54,653 INFO L142 LiptonReduction]: Number of co-enabled transitions 180 [2021-03-25 14:50:55,941 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-03-25 14:50:56,372 INFO L154 LiptonReduction]: Checked pairs total: 908 [2021-03-25 14:50:56,373 INFO L156 LiptonReduction]: Total number of compositions: 15 [2021-03-25 14:50:56,373 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1729 [2021-03-25 14:50:56,374 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 58 flow [2021-03-25 14:50:56,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:56,374 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:50:56,375 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:50:56,375 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:50:56,375 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:50:56,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:50:56,376 INFO L82 PathProgramCache]: Analyzing trace with hash -794954721, now seen corresponding path program 1 times [2021-03-25 14:50:56,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:50:56,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803090055] [2021-03-25 14:50:56,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:50:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:50:56,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:50:56,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:50:56,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:50:56,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:50:56,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:50:56,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803090055] [2021-03-25 14:50:56,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:50:56,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:50:56,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422962094] [2021-03-25 14:50:56,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:50:56,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:50:56,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:50:56,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:50:56,441 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 191 [2021-03-25 14:50:56,442 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:56,442 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:50:56,442 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 191 [2021-03-25 14:50:56,442 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:50:56,452 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-25 14:50:56,452 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-25 14:50:56,452 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 22 events. 0/22 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 1/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:50:56,452 INFO L132 encePairwiseOnDemand]: 188/191 looper letters, 1 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2021-03-25 14:50:56,452 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 22 transitions, 64 flow [2021-03-25 14:50:56,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:50:56,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:50:56,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2021-03-25 14:50:56,454 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9232111692844677 [2021-03-25 14:50:56,454 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 529 transitions. [2021-03-25 14:50:56,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 529 transitions. [2021-03-25 14:50:56,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:50:56,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 529 transitions. [2021-03-25 14:50:56,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:56,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:56,458 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:56,458 INFO L185 Difference]: Start difference. First operand has 32 places, 22 transitions, 58 flow. Second operand 3 states and 529 transitions. [2021-03-25 14:50:56,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 22 transitions, 64 flow [2021-03-25 14:50:56,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 22 transitions, 60 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:50:56,459 INFO L241 Difference]: Finished difference. Result has 33 places, 22 transitions, 62 flow [2021-03-25 14:50:56,459 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2021-03-25 14:50:56,460 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -15 predicate places. [2021-03-25 14:50:56,460 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:50:56,460 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 62 flow [2021-03-25 14:50:56,460 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 62 flow [2021-03-25 14:50:56,461 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 62 flow [2021-03-25 14:50:56,464 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-25 14:50:56,464 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-25 14:50:56,465 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 22 events. 0/22 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 18 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:50:56,465 INFO L142 LiptonReduction]: Number of co-enabled transitions 158 [2021-03-25 14:50:56,788 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-25 14:50:57,052 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-25 14:50:57,176 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-25 14:50:57,740 WARN L205 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 161 [2021-03-25 14:50:57,969 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2021-03-25 14:50:58,481 WARN L205 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 161 [2021-03-25 14:50:58,710 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2021-03-25 14:50:58,724 INFO L154 LiptonReduction]: Checked pairs total: 501 [2021-03-25 14:50:58,724 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:50:58,724 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2264 [2021-03-25 14:50:58,725 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 56 flow [2021-03-25 14:50:58,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:58,725 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:50:58,726 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:50:58,726 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:50:58,726 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:50:58,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:50:58,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1564934884, now seen corresponding path program 1 times [2021-03-25 14:50:58,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:50:58,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222461098] [2021-03-25 14:50:58,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:50:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:50:58,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:50:58,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:50:58,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:50:58,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:50:58,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:50:58,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:50:58,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:50:58,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:50:58,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:50:58,817 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222461098] [2021-03-25 14:50:58,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:50:58,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:50:58,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044255305] [2021-03-25 14:50:58,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:50:58,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:50:58,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:50:58,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:50:58,819 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 194 [2021-03-25 14:50:58,820 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 56 flow. Second operand has 5 states, 5 states have (on average 170.8) internal successors, (854), 5 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:58,820 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:50:58,820 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 194 [2021-03-25 14:50:58,820 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:50:58,841 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-25 14:50:58,841 INFO L130 PetriNetUnfolder]: For 11/18 co-relation queries the response was YES. [2021-03-25 14:50:58,841 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 24 events. 0/24 cut-off events. For 11/18 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 2/26 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-25 14:50:58,841 INFO L132 encePairwiseOnDemand]: 190/194 looper letters, 1 selfloop transitions, 3 changer transitions 1/20 dead transitions. [2021-03-25 14:50:58,842 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 20 transitions, 71 flow [2021-03-25 14:50:58,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:50:58,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:50:58,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 687 transitions. [2021-03-25 14:50:58,844 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8853092783505154 [2021-03-25 14:50:58,844 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 687 transitions. [2021-03-25 14:50:58,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 687 transitions. [2021-03-25 14:50:58,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:50:58,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 687 transitions. [2021-03-25 14:50:58,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:58,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:58,848 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:50:58,848 INFO L185 Difference]: Start difference. First operand has 30 places, 19 transitions, 56 flow. Second operand 4 states and 687 transitions. [2021-03-25 14:50:58,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 20 transitions, 71 flow [2021-03-25 14:50:58,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 20 transitions, 65 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:50:58,849 INFO L241 Difference]: Finished difference. Result has 33 places, 19 transitions, 66 flow [2021-03-25 14:50:58,849 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=66, PETRI_PLACES=33, PETRI_TRANSITIONS=19} [2021-03-25 14:50:58,850 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -15 predicate places. [2021-03-25 14:50:58,850 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:50:58,850 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 19 transitions, 66 flow [2021-03-25 14:50:58,852 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 19 transitions, 66 flow [2021-03-25 14:50:58,852 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 19 transitions, 66 flow [2021-03-25 14:50:58,855 INFO L129 PetriNetUnfolder]: 0/19 cut-off events. [2021-03-25 14:50:58,855 INFO L130 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2021-03-25 14:50:58,855 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 19 events. 0/19 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:50:58,856 INFO L142 LiptonReduction]: Number of co-enabled transitions 142 [2021-03-25 14:50:59,147 WARN L205 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 197 [2021-03-25 14:50:59,450 WARN L205 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 197 [2021-03-25 14:51:00,043 WARN L205 SmtUtils]: Spent 591.00 ms on a formula simplification that was a NOOP. DAG size: 276 [2021-03-25 14:51:00,605 WARN L205 SmtUtils]: Spent 560.00 ms on a formula simplification that was a NOOP. DAG size: 276 [2021-03-25 14:51:03,268 INFO L154 LiptonReduction]: Checked pairs total: 236 [2021-03-25 14:51:03,268 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:51:03,268 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4418 [2021-03-25 14:51:03,269 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 18 transitions, 64 flow [2021-03-25 14:51:03,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 170.8) internal successors, (854), 5 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:03,270 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:51:03,270 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:51:03,270 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:51:03,270 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:51:03,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:51:03,270 INFO L82 PathProgramCache]: Analyzing trace with hash 396852565, now seen corresponding path program 1 times [2021-03-25 14:51:03,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:51:03,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202515588] [2021-03-25 14:51:03,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:51:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:51:03,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:03,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:51:03,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:03,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:51:03,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:51:03,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202515588] [2021-03-25 14:51:03,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:51:03,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:51:03,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849981017] [2021-03-25 14:51:03,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:51:03,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:51:03,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:51:03,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:51:03,324 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 195 [2021-03-25 14:51:03,325 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 18 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:03,325 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:51:03,325 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 195 [2021-03-25 14:51:03,325 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:51:03,342 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-25 14:51:03,342 INFO L130 PetriNetUnfolder]: For 30/33 co-relation queries the response was YES. [2021-03-25 14:51:03,342 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 24 events. 0/24 cut-off events. For 30/33 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 38 event pairs, 0 based on Foata normal form. 3/27 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-25 14:51:03,343 INFO L132 encePairwiseOnDemand]: 191/195 looper letters, 1 selfloop transitions, 3 changer transitions 1/19 dead transitions. [2021-03-25 14:51:03,343 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 19 transitions, 77 flow [2021-03-25 14:51:03,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:51:03,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:51:03,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 691 transitions. [2021-03-25 14:51:03,345 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8858974358974359 [2021-03-25 14:51:03,345 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 691 transitions. [2021-03-25 14:51:03,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 691 transitions. [2021-03-25 14:51:03,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:51:03,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 691 transitions. [2021-03-25 14:51:03,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:03,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:03,349 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:03,349 INFO L185 Difference]: Start difference. First operand has 32 places, 18 transitions, 64 flow. Second operand 4 states and 691 transitions. [2021-03-25 14:51:03,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 19 transitions, 77 flow [2021-03-25 14:51:03,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 19 transitions, 65 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-25 14:51:03,350 INFO L241 Difference]: Finished difference. Result has 33 places, 18 transitions, 66 flow [2021-03-25 14:51:03,350 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=66, PETRI_PLACES=33, PETRI_TRANSITIONS=18} [2021-03-25 14:51:03,351 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -15 predicate places. [2021-03-25 14:51:03,351 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:51:03,351 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 18 transitions, 66 flow [2021-03-25 14:51:03,351 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 18 transitions, 66 flow [2021-03-25 14:51:03,351 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 18 transitions, 66 flow [2021-03-25 14:51:03,354 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-03-25 14:51:03,354 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-25 14:51:03,354 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 18 events. 0/18 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:51:03,354 INFO L142 LiptonReduction]: Number of co-enabled transitions 96 [2021-03-25 14:51:03,961 INFO L154 LiptonReduction]: Checked pairs total: 143 [2021-03-25 14:51:03,962 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:51:03,962 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 611 [2021-03-25 14:51:03,963 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 17 transitions, 64 flow [2021-03-25 14:51:03,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:03,963 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:51:03,963 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:51:03,963 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:51:03,964 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:51:03,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:51:03,964 INFO L82 PathProgramCache]: Analyzing trace with hash 490286451, now seen corresponding path program 1 times [2021-03-25 14:51:03,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:51:03,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012935341] [2021-03-25 14:51:03,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:51:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:51:04,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:04,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 14:51:04,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:04,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 14:51:04,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:04,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 14:51:04,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:04,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 14:51:04,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:04,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:51:04,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:51:04,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012935341] [2021-03-25 14:51:04,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:51:04,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:51:04,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292243965] [2021-03-25 14:51:04,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:51:04,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:51:04,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:51:04,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:51:04,156 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 196 [2021-03-25 14:51:04,157 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 17 transitions, 64 flow. Second operand has 6 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:04,157 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:51:04,157 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 196 [2021-03-25 14:51:04,157 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:51:04,263 INFO L129 PetriNetUnfolder]: 6/33 cut-off events. [2021-03-25 14:51:04,263 INFO L130 PetriNetUnfolder]: For 29/30 co-relation queries the response was YES. [2021-03-25 14:51:04,264 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 33 events. 6/33 cut-off events. For 29/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 1 based on Foata normal form. 1/34 useless extension candidates. Maximal degree in co-relation 74. Up to 10 conditions per place. [2021-03-25 14:51:04,264 INFO L132 encePairwiseOnDemand]: 192/196 looper letters, 9 selfloop transitions, 3 changer transitions 0/21 dead transitions. [2021-03-25 14:51:04,264 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 21 transitions, 96 flow [2021-03-25 14:51:04,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:51:04,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:51:04,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 517 transitions. [2021-03-25 14:51:04,266 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6594387755102041 [2021-03-25 14:51:04,266 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 517 transitions. [2021-03-25 14:51:04,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 517 transitions. [2021-03-25 14:51:04,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:51:04,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 517 transitions. [2021-03-25 14:51:04,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:04,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:04,270 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 196.0) internal successors, (980), 5 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:04,270 INFO L185 Difference]: Start difference. First operand has 32 places, 17 transitions, 64 flow. Second operand 4 states and 517 transitions. [2021-03-25 14:51:04,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 21 transitions, 96 flow [2021-03-25 14:51:04,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 21 transitions, 80 flow, removed 3 selfloop flow, removed 5 redundant places. [2021-03-25 14:51:04,271 INFO L241 Difference]: Finished difference. Result has 31 places, 17 transitions, 58 flow [2021-03-25 14:51:04,271 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=58, PETRI_PLACES=31, PETRI_TRANSITIONS=17} [2021-03-25 14:51:04,271 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -17 predicate places. [2021-03-25 14:51:04,271 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:51:04,272 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 17 transitions, 58 flow [2021-03-25 14:51:04,272 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 17 transitions, 58 flow [2021-03-25 14:51:04,272 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 17 transitions, 58 flow [2021-03-25 14:51:04,275 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-03-25 14:51:04,275 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-25 14:51:04,275 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 17 events. 0/17 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:51:04,275 INFO L142 LiptonReduction]: Number of co-enabled transitions 84 [2021-03-25 14:51:05,569 INFO L154 LiptonReduction]: Checked pairs total: 123 [2021-03-25 14:51:05,569 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:51:05,570 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1299 [2021-03-25 14:51:05,570 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 16 transitions, 56 flow [2021-03-25 14:51:05,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:05,571 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:51:05,571 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:51:05,571 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:51:05,571 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:51:05,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:51:05,571 INFO L82 PathProgramCache]: Analyzing trace with hash 453645123, now seen corresponding path program 1 times [2021-03-25 14:51:05,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:51:05,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661764317] [2021-03-25 14:51:05,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:51:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:51:05,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:05,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:51:05,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:05,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:51:05,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:05,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:51:05,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:51:05,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661764317] [2021-03-25 14:51:05,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:51:05,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:51:05,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644038653] [2021-03-25 14:51:05,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:51:05,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:51:05,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:51:05,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:51:05,646 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 197 [2021-03-25 14:51:05,647 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 16 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 168.75) internal successors, (675), 4 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:05,647 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:51:05,647 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 197 [2021-03-25 14:51:05,648 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:51:05,688 INFO L129 PetriNetUnfolder]: 28/74 cut-off events. [2021-03-25 14:51:05,688 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-03-25 14:51:05,688 INFO L84 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 74 events. 28/74 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 253 event pairs, 12 based on Foata normal form. 8/76 useless extension candidates. Maximal degree in co-relation 153. Up to 45 conditions per place. [2021-03-25 14:51:05,689 INFO L132 encePairwiseOnDemand]: 191/197 looper letters, 5 selfloop transitions, 4 changer transitions 7/26 dead transitions. [2021-03-25 14:51:05,689 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 26 transitions, 108 flow [2021-03-25 14:51:05,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:51:05,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:51:05,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 858 transitions. [2021-03-25 14:51:05,692 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8710659898477158 [2021-03-25 14:51:05,692 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 858 transitions. [2021-03-25 14:51:05,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 858 transitions. [2021-03-25 14:51:05,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:51:05,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 858 transitions. [2021-03-25 14:51:05,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 171.6) internal successors, (858), 5 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:05,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:05,697 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:05,697 INFO L185 Difference]: Start difference. First operand has 30 places, 16 transitions, 56 flow. Second operand 5 states and 858 transitions. [2021-03-25 14:51:05,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 26 transitions, 108 flow [2021-03-25 14:51:05,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 98 flow, removed 1 selfloop flow, removed 4 redundant places. [2021-03-25 14:51:05,699 INFO L241 Difference]: Finished difference. Result has 33 places, 19 transitions, 82 flow [2021-03-25 14:51:05,699 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=33, PETRI_TRANSITIONS=19} [2021-03-25 14:51:05,699 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -15 predicate places. [2021-03-25 14:51:05,699 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:51:05,699 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 19 transitions, 82 flow [2021-03-25 14:51:05,699 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 19 transitions, 82 flow [2021-03-25 14:51:05,700 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 19 transitions, 82 flow [2021-03-25 14:51:05,709 INFO L129 PetriNetUnfolder]: 23/61 cut-off events. [2021-03-25 14:51:05,709 INFO L130 PetriNetUnfolder]: For 32/36 co-relation queries the response was YES. [2021-03-25 14:51:05,709 INFO L84 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 61 events. 23/61 cut-off events. For 32/36 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 189 event pairs, 11 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 154. Up to 38 conditions per place. [2021-03-25 14:51:05,712 INFO L142 LiptonReduction]: Number of co-enabled transitions 70 [2021-03-25 14:51:06,074 WARN L205 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 205 [2021-03-25 14:51:06,404 WARN L205 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 205 [2021-03-25 14:51:06,992 WARN L205 SmtUtils]: Spent 585.00 ms on a formula simplification that was a NOOP. DAG size: 284 [2021-03-25 14:51:07,583 WARN L205 SmtUtils]: Spent 589.00 ms on a formula simplification that was a NOOP. DAG size: 284 [2021-03-25 14:51:07,586 INFO L154 LiptonReduction]: Checked pairs total: 46 [2021-03-25 14:51:07,586 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:51:07,586 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1887 [2021-03-25 14:51:07,587 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 83 flow [2021-03-25 14:51:07,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 168.75) internal successors, (675), 4 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:07,587 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:51:07,587 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:51:07,587 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:51:07,588 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:51:07,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:51:07,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1981742594, now seen corresponding path program 1 times [2021-03-25 14:51:07,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:51:07,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706816493] [2021-03-25 14:51:07,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:51:07,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:51:07,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:07,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:51:07,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:07,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:51:07,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:07,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:51:07,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:07,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:51:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:51:07,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706816493] [2021-03-25 14:51:07,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:51:07,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:51:07,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891582448] [2021-03-25 14:51:07,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:51:07,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:51:07,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:51:07,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:51:07,648 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 198 [2021-03-25 14:51:07,649 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 83 flow. Second operand has 5 states, 5 states have (on average 168.8) internal successors, (844), 5 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:07,649 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:51:07,649 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 198 [2021-03-25 14:51:07,649 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:51:07,698 INFO L129 PetriNetUnfolder]: 16/55 cut-off events. [2021-03-25 14:51:07,699 INFO L130 PetriNetUnfolder]: For 49/72 co-relation queries the response was YES. [2021-03-25 14:51:07,699 INFO L84 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 55 events. 16/55 cut-off events. For 49/72 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 148 event pairs, 2 based on Foata normal form. 11/63 useless extension candidates. Maximal degree in co-relation 174. Up to 35 conditions per place. [2021-03-25 14:51:07,699 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 5 selfloop transitions, 7 changer transitions 7/29 dead transitions. [2021-03-25 14:51:07,699 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 179 flow [2021-03-25 14:51:07,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:51:07,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:51:07,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1029 transitions. [2021-03-25 14:51:07,702 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8661616161616161 [2021-03-25 14:51:07,702 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1029 transitions. [2021-03-25 14:51:07,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1029 transitions. [2021-03-25 14:51:07,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:51:07,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1029 transitions. [2021-03-25 14:51:07,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 171.5) internal successors, (1029), 6 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:07,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:07,706 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:07,707 INFO L185 Difference]: Start difference. First operand has 31 places, 19 transitions, 83 flow. Second operand 6 states and 1029 transitions. [2021-03-25 14:51:07,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 179 flow [2021-03-25 14:51:07,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 173 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:51:07,708 INFO L241 Difference]: Finished difference. Result has 37 places, 22 transitions, 133 flow [2021-03-25 14:51:07,708 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=133, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2021-03-25 14:51:07,708 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -11 predicate places. [2021-03-25 14:51:07,709 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:51:07,709 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 22 transitions, 133 flow [2021-03-25 14:51:07,709 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 22 transitions, 133 flow [2021-03-25 14:51:07,709 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 22 transitions, 133 flow [2021-03-25 14:51:07,714 INFO L129 PetriNetUnfolder]: 11/43 cut-off events. [2021-03-25 14:51:07,714 INFO L130 PetriNetUnfolder]: For 65/73 co-relation queries the response was YES. [2021-03-25 14:51:07,714 INFO L84 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 43 events. 11/43 cut-off events. For 65/73 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 94 event pairs, 2 based on Foata normal form. 2/43 useless extension candidates. Maximal degree in co-relation 141. Up to 23 conditions per place. [2021-03-25 14:51:07,715 INFO L142 LiptonReduction]: Number of co-enabled transitions 60 [2021-03-25 14:51:07,760 INFO L154 LiptonReduction]: Checked pairs total: 37 [2021-03-25 14:51:07,760 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:51:07,761 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 52 [2021-03-25 14:51:07,761 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 135 flow [2021-03-25 14:51:07,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 168.8) internal successors, (844), 5 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:07,762 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:51:07,762 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:51:07,762 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:51:07,762 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:51:07,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:51:07,762 INFO L82 PathProgramCache]: Analyzing trace with hash -773316986, now seen corresponding path program 1 times [2021-03-25 14:51:07,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:51:07,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546018868] [2021-03-25 14:51:07,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:51:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:51:07,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:07,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:51:07,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:07,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:51:07,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:07,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:51:07,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:07,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:51:07,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:51:07,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:51:07,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:51:07,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546018868] [2021-03-25 14:51:07,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:51:07,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:51:07,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552998649] [2021-03-25 14:51:07,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:51:07,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:51:07,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:51:07,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:51:07,874 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 199 [2021-03-25 14:51:07,875 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 135 flow. Second operand has 6 states, 6 states have (on average 168.83333333333334) internal successors, (1013), 6 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:07,875 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:51:07,875 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 199 [2021-03-25 14:51:07,875 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:51:07,931 INFO L129 PetriNetUnfolder]: 7/36 cut-off events. [2021-03-25 14:51:07,932 INFO L130 PetriNetUnfolder]: For 99/132 co-relation queries the response was YES. [2021-03-25 14:51:07,932 INFO L84 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 36 events. 7/36 cut-off events. For 99/132 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 0 based on Foata normal form. 10/43 useless extension candidates. Maximal degree in co-relation 132. Up to 20 conditions per place. [2021-03-25 14:51:07,932 INFO L132 encePairwiseOnDemand]: 191/199 looper letters, 2 selfloop transitions, 10 changer transitions 4/26 dead transitions. [2021-03-25 14:51:07,932 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 26 transitions, 203 flow [2021-03-25 14:51:07,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:51:07,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:51:07,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1194 transitions. [2021-03-25 14:51:07,936 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2021-03-25 14:51:07,936 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1194 transitions. [2021-03-25 14:51:07,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1194 transitions. [2021-03-25 14:51:07,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:51:07,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1194 transitions. [2021-03-25 14:51:07,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 170.57142857142858) internal successors, (1194), 7 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:07,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:07,943 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:07,944 INFO L185 Difference]: Start difference. First operand has 35 places, 22 transitions, 135 flow. Second operand 7 states and 1194 transitions. [2021-03-25 14:51:07,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 26 transitions, 203 flow [2021-03-25 14:51:07,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 26 transitions, 163 flow, removed 15 selfloop flow, removed 5 redundant places. [2021-03-25 14:51:07,947 INFO L241 Difference]: Finished difference. Result has 39 places, 22 transitions, 133 flow [2021-03-25 14:51:07,947 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=133, PETRI_PLACES=39, PETRI_TRANSITIONS=22} [2021-03-25 14:51:07,948 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -9 predicate places. [2021-03-25 14:51:07,948 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:51:07,948 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 22 transitions, 133 flow [2021-03-25 14:51:07,948 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 22 transitions, 133 flow [2021-03-25 14:51:07,948 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 22 transitions, 133 flow [2021-03-25 14:51:07,952 INFO L129 PetriNetUnfolder]: 5/30 cut-off events. [2021-03-25 14:51:07,952 INFO L130 PetriNetUnfolder]: For 39/42 co-relation queries the response was YES. [2021-03-25 14:51:07,952 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 30 events. 5/30 cut-off events. For 39/42 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 1/28 useless extension candidates. Maximal degree in co-relation 80. Up to 11 conditions per place. [2021-03-25 14:51:07,953 INFO L142 LiptonReduction]: Number of co-enabled transitions 40 [2021-03-25 14:51:08,207 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 82 [2021-03-25 14:51:08,693 WARN L205 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 112 [2021-03-25 14:51:08,886 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2021-03-25 14:51:09,009 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-03-25 14:51:09,131 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2021-03-25 14:51:09,368 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2021-03-25 14:51:09,570 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2021-03-25 14:51:09,706 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2021-03-25 14:51:09,839 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2021-03-25 14:51:10,077 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2021-03-25 14:51:10,329 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2021-03-25 14:51:10,678 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2021-03-25 14:51:10,855 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2021-03-25 14:51:10,857 INFO L154 LiptonReduction]: Checked pairs total: 4 [2021-03-25 14:51:10,857 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 14:51:10,858 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2910 [2021-03-25 14:51:10,858 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 19 transitions, 128 flow [2021-03-25 14:51:10,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 168.83333333333334) internal successors, (1013), 6 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:51:10,859 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:51:10,859 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:51:10,859 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:51:10,859 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:51:10,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:51:10,859 INFO L82 PathProgramCache]: Analyzing trace with hash -952231413, now seen corresponding path program 1 times [2021-03-25 14:51:10,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:51:10,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926307042] [2021-03-25 14:51:10,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:51:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:51:10,923 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:51:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:51:10,990 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:51:11,031 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:51:11,031 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:51:11,032 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:51:11,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:51:11 BasicIcfg [2021-03-25 14:51:11,141 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:51:11,141 INFO L168 Benchmark]: Toolchain (without parser) took 27395.66 ms. Allocated memory was 255.9 MB in the beginning and 685.8 MB in the end (delta: 429.9 MB). Free memory was 232.8 MB in the beginning and 653.6 MB in the end (delta: -420.8 MB). Peak memory consumption was 336.9 MB. Max. memory is 16.0 GB. [2021-03-25 14:51:11,142 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:51:11,142 INFO L168 Benchmark]: CACSL2BoogieTranslator took 540.34 ms. Allocated memory was 255.9 MB in the beginning and 325.1 MB in the end (delta: 69.2 MB). Free memory was 232.8 MB in the beginning and 285.4 MB in the end (delta: -52.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. [2021-03-25 14:51:11,142 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.82 ms. Allocated memory is still 325.1 MB. Free memory was 285.4 MB in the beginning and 283.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:51:11,142 INFO L168 Benchmark]: Boogie Preprocessor took 32.06 ms. Allocated memory is still 325.1 MB. Free memory was 283.3 MB in the beginning and 281.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:51:11,143 INFO L168 Benchmark]: RCFGBuilder took 1685.34 ms. Allocated memory is still 325.1 MB. Free memory was 281.2 MB in the beginning and 294.4 MB in the end (delta: -13.2 MB). Peak memory consumption was 69.6 MB. Max. memory is 16.0 GB. [2021-03-25 14:51:11,143 INFO L168 Benchmark]: TraceAbstraction took 25086.32 ms. Allocated memory was 325.1 MB in the beginning and 685.8 MB in the end (delta: 360.7 MB). Free memory was 293.4 MB in the beginning and 653.6 MB in the end (delta: -360.2 MB). Peak memory consumption was 329.8 MB. Max. memory is 16.0 GB. [2021-03-25 14:51:11,144 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 540.34 ms. Allocated memory was 255.9 MB in the beginning and 325.1 MB in the end (delta: 69.2 MB). Free memory was 232.8 MB in the beginning and 285.4 MB in the end (delta: -52.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 43.82 ms. Allocated memory is still 325.1 MB. Free memory was 285.4 MB in the beginning and 283.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 32.06 ms. Allocated memory is still 325.1 MB. Free memory was 283.3 MB in the beginning and 281.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1685.34 ms. Allocated memory is still 325.1 MB. Free memory was 281.2 MB in the beginning and 294.4 MB in the end (delta: -13.2 MB). Peak memory consumption was 69.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 25086.32 ms. Allocated memory was 325.1 MB in the beginning and 685.8 MB in the end (delta: 360.7 MB). Free memory was 293.4 MB in the beginning and 653.6 MB in the end (delta: -360.2 MB). Peak memory consumption was 329.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7856.7ms, 108 PlacesBefore, 48 PlacesAfterwards, 99 TransitionsBefore, 39 TransitionsAfterwards, 954 CoEnabledTransitionPairs, 4 FixpointIterations, 38 TrivialSequentialCompositions, 23 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 62 TotalNumberOfCompositions, 1446 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 801, positive: 746, positive conditional: 0, positive unconditional: 746, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 617, positive: 588, positive conditional: 0, positive unconditional: 588, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 617, positive: 588, positive conditional: 0, positive unconditional: 588, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 617, positive: 581, positive conditional: 0, positive unconditional: 581, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 36, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1873, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 530, negative conditional: 0, negative unconditional: 530, unknown: 1319, unknown conditional: 0, unknown unconditional: 1319] ], Cache Queries: [ total: 801, positive: 158, positive conditional: 0, positive unconditional: 158, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 617, unknown conditional: 0, unknown unconditional: 617] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 76, Positive conditional cache size: 0, Positive unconditional cache size: 76, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1726.8ms, 47 PlacesBefore, 32 PlacesAfterwards, 37 TransitionsBefore, 22 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 5 FixpointIterations, 14 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 908 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 348, positive: 269, positive conditional: 0, positive unconditional: 269, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 36, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 36, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 216, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 200, negative conditional: 0, negative unconditional: 200, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 348, positive: 246, positive conditional: 0, positive unconditional: 246, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 36, unknown conditional: 0, unknown unconditional: 36] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 79, Positive conditional cache size: 0, Positive unconditional cache size: 79, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2263.5ms, 33 PlacesBefore, 30 PlacesAfterwards, 22 TransitionsBefore, 19 TransitionsAfterwards, 158 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 501 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 181, positive: 136, positive conditional: 0, positive unconditional: 136, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 181, positive: 135, positive conditional: 0, positive unconditional: 135, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 80, Positive conditional cache size: 0, Positive unconditional cache size: 80, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4416.4ms, 33 PlacesBefore, 32 PlacesAfterwards, 19 TransitionsBefore, 18 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 236 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 96, positive: 72, positive conditional: 0, positive unconditional: 72, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 1, negative conditional: 0, negative unconditional: 1, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2660, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 2630, unknown conditional: 0, unknown unconditional: 2630] ], Cache Queries: [ total: 96, positive: 71, positive conditional: 0, positive unconditional: 71, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 68, Positive cache size: 55, Positive conditional cache size: 0, Positive unconditional cache size: 55, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 610.7ms, 33 PlacesBefore, 32 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 96 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 143 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, 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: 5, positive: 4, positive conditional: 0, 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: 5, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 587, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 587, unknown conditional: 0, unknown unconditional: 587] ], Cache Queries: [ total: 59, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 38, Positive conditional cache size: 0, Positive unconditional cache size: 38, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1297.6ms, 31 PlacesBefore, 30 PlacesAfterwards, 17 TransitionsBefore, 16 TransitionsAfterwards, 84 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 123 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 52, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 7, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 7, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 0, negative conditional: 0, negative unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1270, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1270, unknown conditional: 0, unknown unconditional: 1270] ], Cache Queries: [ total: 52, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 34, Positive conditional cache size: 0, Positive unconditional cache size: 34, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1886.5ms, 33 PlacesBefore, 31 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 46 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 32, Positive cache size: 23, Positive conditional cache size: 0, Positive unconditional cache size: 23, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 51.7ms, 37 PlacesBefore, 35 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 60 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 37 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2909.5ms, 39 PlacesBefore, 34 PlacesAfterwards, 22 TransitionsBefore, 19 TransitionsAfterwards, 40 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 4 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 3, Positive cache size: 3, Positive conditional cache size: 0, Positive unconditional cache size: 3, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1949; [L837] FCALL, FORK 0 pthread_create(&t1949, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={6:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1950; [L839] FCALL, FORK 0 pthread_create(&t1950, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={6:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1951; [L841] FCALL, FORK 0 pthread_create(&t1951, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={6:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] EXPR 1 \read(z) [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] 1 z = !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L768] EXPR 1 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L768] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L769] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L769] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L770] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L770] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L771] EXPR 1 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L771] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] EXPR 1 weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L772] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L773] EXPR 1 weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L776] EXPR 1 \read(z) [L776] 1 __unbuffered_p0_EAX = z [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] 1 z = z$flush_delayed ? z$mem_tmp : z [L778] 1 z$flush_delayed = (_Bool)0 [L781] 1 x = 1 [L786] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 1 return 0; [L793] 2 __unbuffered_p1_EAX = x [L796] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z={6:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 __unbuffered_p2_EAX = y [L811] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z={6:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 \read(z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L816] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L818] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 \read(z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=255, weak$$choice2=1, x=1, y=1, z={6:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 6.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 24850.3ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 483.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7933.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 25 SDtfs, 11 SDslu, 14 SDs, 0 SdLazy, 137 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 121.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 124.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=7, InterpolantAutomatonStates: 36, 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: 35.2ms SsaConstructionTime, 430.6ms SatisfiabilityAnalysisTime, 503.9ms InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 573 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...