/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 20:06:29,242 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 20:06:29,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 20:06:29,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 20:06:29,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 20:06:29,270 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 20:06:29,271 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 20:06:29,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 20:06:29,274 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 20:06:29,275 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 20:06:29,276 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 20:06:29,277 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 20:06:29,278 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 20:06:29,279 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 20:06:29,280 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 20:06:29,281 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 20:06:29,281 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 20:06:29,282 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 20:06:29,284 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 20:06:29,285 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 20:06:29,287 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 20:06:29,288 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 20:06:29,289 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 20:06:29,289 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 20:06:29,292 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 20:06:29,292 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 20:06:29,292 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 20:06:29,293 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 20:06:29,293 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 20:06:29,294 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 20:06:29,294 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 20:06:29,295 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 20:06:29,296 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 20:06:29,296 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 20:06:29,297 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 20:06:29,298 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 20:06:29,298 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 20:06:29,298 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 20:06:29,299 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 20:06:29,299 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 20:06:29,300 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 20:06:29,301 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-SemanticLbe.epf [2021-03-11 20:06:29,323 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 20:06:29,324 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 20:06:29,325 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 20:06:29,325 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 20:06:29,325 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 20:06:29,325 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 20:06:29,325 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 20:06:29,326 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 20:06:29,326 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 20:06:29,326 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 20:06:29,326 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 20:06:29,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 20:06:29,326 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 20:06:29,326 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 20:06:29,327 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 20:06:29,327 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 20:06:29,327 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 20:06:29,327 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 20:06:29,327 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 20:06:29,327 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 20:06:29,328 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 20:06:29,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:06:29,328 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 20:06:29,328 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 20:06:29,328 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 20:06:29,328 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 20:06:29,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 20:06:29,329 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 20:06:29,329 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-11 20:06:29,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 20:06:29,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 20:06:29,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 20:06:29,628 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 20:06:29,629 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 20:06:29,629 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.opt.i [2021-03-11 20:06:29,687 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0d191852/a6e45e65e2254689a2caa423330a3b9d/FLAG5eefc8ed4 [2021-03-11 20:06:30,190 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 20:06:30,191 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_tso.opt.i [2021-03-11 20:06:30,211 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0d191852/a6e45e65e2254689a2caa423330a3b9d/FLAG5eefc8ed4 [2021-03-11 20:06:30,487 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0d191852/a6e45e65e2254689a2caa423330a3b9d [2021-03-11 20:06:30,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 20:06:30,494 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 20:06:30,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 20:06:30,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 20:06:30,498 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 20:06:30,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:06:30" (1/1) ... [2021-03-11 20:06:30,499 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6106c206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:06:30, skipping insertion in model container [2021-03-11 20:06:30,499 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:06:30" (1/1) ... [2021-03-11 20:06:30,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 20:06:30,555 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 20:06:30,670 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_tso.opt.i[948,961] [2021-03-11 20:06:30,923 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:06:30,930 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 20:06:30,939 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/mix028_tso.opt.i[948,961] [2021-03-11 20:06:30,970 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:06:31,025 INFO L208 MainTranslator]: Completed translation [2021-03-11 20:06:31,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:06:31 WrapperNode [2021-03-11 20:06:31,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 20:06:31,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 20:06:31,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 20:06:31,027 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 20:06:31,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:06:31" (1/1) ... [2021-03-11 20:06:31,048 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:06:31" (1/1) ... [2021-03-11 20:06:31,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 20:06:31,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 20:06:31,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 20:06:31,077 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 20:06:31,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:06:31" (1/1) ... [2021-03-11 20:06:31,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:06:31" (1/1) ... [2021-03-11 20:06:31,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:06:31" (1/1) ... [2021-03-11 20:06:31,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:06:31" (1/1) ... [2021-03-11 20:06:31,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:06:31" (1/1) ... [2021-03-11 20:06:31,098 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:06:31" (1/1) ... [2021-03-11 20:06:31,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:06:31" (1/1) ... [2021-03-11 20:06:31,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 20:06:31,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 20:06:31,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 20:06:31,121 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 20:06:31,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:06:31" (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-11 20:06:31,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 20:06:31,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 20:06:31,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 20:06:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 20:06:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 20:06:31,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 20:06:31,199 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 20:06:31,200 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 20:06:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 20:06:31,201 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 20:06:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 20:06:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 20:06:31,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 20:06:31,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 20:06:31,203 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 20:06:33,290 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 20:06:33,290 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 20:06:33,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:06:33 BoogieIcfgContainer [2021-03-11 20:06:33,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 20:06:33,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 20:06:33,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 20:06:33,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 20:06:33,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 08:06:30" (1/3) ... [2021-03-11 20:06:33,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a175d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:06:33, skipping insertion in model container [2021-03-11 20:06:33,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:06:31" (2/3) ... [2021-03-11 20:06:33,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a175d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:06:33, skipping insertion in model container [2021-03-11 20:06:33,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:06:33" (3/3) ... [2021-03-11 20:06:33,298 INFO L111 eAbstractionObserver]: Analyzing ICFG mix028_tso.opt.i [2021-03-11 20:06:33,303 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 20:06:33,307 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 20:06:33,307 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 20:06:33,341 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,342 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,342 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,342 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,343 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,344 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,344 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,344 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,345 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,348 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,349 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,349 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,349 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,349 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,350 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,350 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,350 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,357 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,358 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,364 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,365 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,366 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,369 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,369 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,370 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,371 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,373 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,374 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,375 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,377 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,378 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:06:33,379 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 20:06:33,394 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-11 20:06:33,411 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 20:06:33,412 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 20:06:33,412 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 20:06:33,412 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 20:06:33,412 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 20:06:33,412 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 20:06:33,412 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 20:06:33,412 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 20:06:33,421 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 211 flow [2021-03-11 20:06:33,453 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-03-11 20:06:33,453 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:06:33,456 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-11 20:06:33,457 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 98 transitions, 211 flow [2021-03-11 20:06:33,460 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 95 transitions, 199 flow [2021-03-11 20:06:33,464 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 20:06:33,471 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 199 flow [2021-03-11 20:06:33,473 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 95 transitions, 199 flow [2021-03-11 20:06:33,473 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 199 flow [2021-03-11 20:06:33,491 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2021-03-11 20:06:33,491 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:06:33,492 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-11 20:06:33,494 INFO L116 LiptonReduction]: Number of co-enabled transitions 1658 [2021-03-11 20:06:33,958 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-11 20:06:34,465 WARN L205 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-11 20:06:34,636 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-11 20:06:35,610 WARN L205 SmtUtils]: Spent 793.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-11 20:06:35,934 WARN L205 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-11 20:06:37,414 WARN L205 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-11 20:06:38,062 WARN L205 SmtUtils]: Spent 645.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-11 20:06:40,766 WARN L205 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 188 [2021-03-11 20:06:41,092 WARN L205 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-11 20:06:41,772 WARN L205 SmtUtils]: Spent 677.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-11 20:06:42,453 WARN L205 SmtUtils]: Spent 680.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-11 20:06:43,396 WARN L205 SmtUtils]: Spent 419.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-03-11 20:06:43,806 WARN L205 SmtUtils]: Spent 408.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-03-11 20:06:44,430 WARN L205 SmtUtils]: Spent 621.00 ms on a formula simplification that was a NOOP. DAG size: 282 [2021-03-11 20:06:45,046 WARN L205 SmtUtils]: Spent 614.00 ms on a formula simplification that was a NOOP. DAG size: 282 [2021-03-11 20:06:45,631 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 109 [2021-03-11 20:06:45,748 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-03-11 20:06:45,997 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 109 [2021-03-11 20:06:46,118 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-03-11 20:06:46,365 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-11 20:06:46,503 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-11 20:06:46,695 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-11 20:06:46,843 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-11 20:06:46,880 INFO L131 LiptonReduction]: Checked pairs total: 4729 [2021-03-11 20:06:46,880 INFO L133 LiptonReduction]: Total number of compositions: 82 [2021-03-11 20:06:46,882 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13421 [2021-03-11 20:06:46,890 INFO L129 PetriNetUnfolder]: 0/12 cut-off events. [2021-03-11 20:06:46,890 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:06:46,890 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:06:46,891 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:06:46,891 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:06:46,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:06:46,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1535173181, now seen corresponding path program 1 times [2021-03-11 20:06:46,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:06:46,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104445028] [2021-03-11 20:06:46,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:06:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:06:47,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:47,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:47,135 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-11 20:06:47,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104445028] [2021-03-11 20:06:47,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:06:47,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:06:47,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008298008] [2021-03-11 20:06:47,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:06:47,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:06:47,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:06:47,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:06:47,161 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 180 [2021-03-11 20:06:47,165 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 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-11 20:06:47,165 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:06:47,165 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 180 [2021-03-11 20:06:47,166 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:06:47,265 INFO L129 PetriNetUnfolder]: 33/94 cut-off events. [2021-03-11 20:06:47,265 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:06:47,266 INFO L84 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 94 events. 33/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 358 event pairs, 3 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 160. Up to 55 conditions per place. [2021-03-11 20:06:47,268 INFO L132 encePairwiseOnDemand]: 177/180 looper letters, 8 selfloop transitions, 2 changer transitions 2/26 dead transitions. [2021-03-11 20:06:47,268 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 26 transitions, 85 flow [2021-03-11 20:06:47,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:06:47,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:06:47,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2021-03-11 20:06:47,280 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8296296296296296 [2021-03-11 20:06:47,281 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 448 transitions. [2021-03-11 20:06:47,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 448 transitions. [2021-03-11 20:06:47,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:06:47,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 448 transitions. [2021-03-11 20:06:47,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 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-11 20:06:47,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 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-11 20:06:47,294 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 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-11 20:06:47,295 INFO L185 Difference]: Start difference. First operand has 33 places, 23 transitions, 55 flow. Second operand 3 states and 448 transitions. [2021-03-11 20:06:47,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 26 transitions, 85 flow [2021-03-11 20:06:47,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 26 transitions, 82 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-11 20:06:47,298 INFO L241 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2021-03-11 20:06:47,304 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, 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=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2021-03-11 20:06:47,304 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2021-03-11 20:06:47,305 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2021-03-11 20:06:47,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 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-11 20:06:47,305 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:06:47,305 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:06:47,305 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 20:06:47,306 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:06:47,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:06:47,307 INFO L82 PathProgramCache]: Analyzing trace with hash -2127566862, now seen corresponding path program 1 times [2021-03-11 20:06:47,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:06:47,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922621037] [2021-03-11 20:06:47,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:06:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:06:47,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:47,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:47,458 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-11 20:06:47,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922621037] [2021-03-11 20:06:47,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:06:47,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:06:47,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793555083] [2021-03-11 20:06:47,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:06:47,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:06:47,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:06:47,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:06:47,461 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 180 [2021-03-11 20:06:47,462 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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-11 20:06:47,462 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:06:47,462 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 180 [2021-03-11 20:06:47,462 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:06:47,475 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-03-11 20:06:47,475 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:06:47,476 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 21 events. 0/21 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. 1/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-11 20:06:47,476 INFO L132 encePairwiseOnDemand]: 177/180 looper letters, 1 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2021-03-11 20:06:47,476 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 21 transitions, 58 flow [2021-03-11 20:06:47,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:06:47,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:06:47,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions. [2021-03-11 20:06:47,481 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8629629629629629 [2021-03-11 20:06:47,481 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 466 transitions. [2021-03-11 20:06:47,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 466 transitions. [2021-03-11 20:06:47,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:06:47,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 466 transitions. [2021-03-11 20:06:47,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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-11 20:06:47,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 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-11 20:06:47,487 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 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-11 20:06:47,487 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 3 states and 466 transitions. [2021-03-11 20:06:47,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 21 transitions, 58 flow [2021-03-11 20:06:47,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 21 transitions, 54 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:06:47,488 INFO L241 Difference]: Finished difference. Result has 31 places, 21 transitions, 56 flow [2021-03-11 20:06:47,488 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2021-03-11 20:06:47,488 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2021-03-11 20:06:47,489 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2021-03-11 20:06:47,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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-11 20:06:47,489 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:06:47,489 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:06:47,489 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 20:06:47,489 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:06:47,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:06:47,490 INFO L82 PathProgramCache]: Analyzing trace with hash -187323047, now seen corresponding path program 1 times [2021-03-11 20:06:47,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:06:47,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60885399] [2021-03-11 20:06:47,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:06:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:06:47,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:47,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:47,555 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-11 20:06:47,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60885399] [2021-03-11 20:06:47,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:06:47,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:06:47,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110832949] [2021-03-11 20:06:47,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:06:47,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:06:47,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:06:47,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:06:47,558 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 180 [2021-03-11 20:06:47,558 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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-11 20:06:47,559 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:06:47,559 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 180 [2021-03-11 20:06:47,559 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:06:47,575 INFO L129 PetriNetUnfolder]: 3/33 cut-off events. [2021-03-11 20:06:47,575 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-03-11 20:06:47,576 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 33 events. 3/33 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 1 based on Foata normal form. 1/32 useless extension candidates. Maximal degree in co-relation 49. Up to 10 conditions per place. [2021-03-11 20:06:47,576 INFO L132 encePairwiseOnDemand]: 176/180 looper letters, 3 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2021-03-11 20:06:47,576 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 23 transitions, 72 flow [2021-03-11 20:06:47,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:06:47,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:06:47,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions. [2021-03-11 20:06:47,579 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8629629629629629 [2021-03-11 20:06:47,579 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 466 transitions. [2021-03-11 20:06:47,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 466 transitions. [2021-03-11 20:06:47,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:06:47,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 466 transitions. [2021-03-11 20:06:47,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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-11 20:06:47,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 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-11 20:06:47,582 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 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-11 20:06:47,583 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 3 states and 466 transitions. [2021-03-11 20:06:47,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 23 transitions, 72 flow [2021-03-11 20:06:47,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 23 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:06:47,584 INFO L241 Difference]: Finished difference. Result has 32 places, 23 transitions, 71 flow [2021-03-11 20:06:47,584 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2021-03-11 20:06:47,584 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, -1 predicate places. [2021-03-11 20:06:47,584 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 71 flow [2021-03-11 20:06:47,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 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-11 20:06:47,585 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:06:47,585 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:06:47,585 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 20:06:47,585 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:06:47,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:06:47,586 INFO L82 PathProgramCache]: Analyzing trace with hash -135551787, now seen corresponding path program 1 times [2021-03-11 20:06:47,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:06:47,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291886488] [2021-03-11 20:06:47,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:06:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:06:47,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:47,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:47,694 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 20:06:47,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:06:47,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:47,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:06:47,702 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-11 20:06:47,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291886488] [2021-03-11 20:06:47,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:06:47,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:06:47,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682845324] [2021-03-11 20:06:47,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:06:47,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:06:47,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:06:47,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:06:47,705 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 180 [2021-03-11 20:06:47,706 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:47,706 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:06:47,706 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 180 [2021-03-11 20:06:47,706 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:06:47,750 INFO L129 PetriNetUnfolder]: 45/119 cut-off events. [2021-03-11 20:06:47,750 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-03-11 20:06:47,751 INFO L84 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 119 events. 45/119 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 529 event pairs, 20 based on Foata normal form. 10/118 useless extension candidates. Maximal degree in co-relation 235. Up to 60 conditions per place. [2021-03-11 20:06:47,752 INFO L132 encePairwiseOnDemand]: 174/180 looper letters, 7 selfloop transitions, 7 changer transitions 2/33 dead transitions. [2021-03-11 20:06:47,752 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 33 transitions, 123 flow [2021-03-11 20:06:47,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:06:47,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:06:47,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 733 transitions. [2021-03-11 20:06:47,754 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8144444444444444 [2021-03-11 20:06:47,755 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 733 transitions. [2021-03-11 20:06:47,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 733 transitions. [2021-03-11 20:06:47,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:06:47,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 733 transitions. [2021-03-11 20:06:47,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.6) internal successors, (733), 5 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:47,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 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-11 20:06:47,759 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 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-11 20:06:47,759 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 71 flow. Second operand 5 states and 733 transitions. [2021-03-11 20:06:47,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 33 transitions, 123 flow [2021-03-11 20:06:47,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 120 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 20:06:47,761 INFO L241 Difference]: Finished difference. Result has 38 places, 29 transitions, 122 flow [2021-03-11 20:06:47,761 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2021-03-11 20:06:47,761 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2021-03-11 20:06:47,762 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 122 flow [2021-03-11 20:06:47,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:47,762 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:06:47,762 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:06:47,762 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 20:06:47,762 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:06:47,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:06:47,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1361792619, now seen corresponding path program 1 times [2021-03-11 20:06:47,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:06:47,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961060358] [2021-03-11 20:06:47,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:06:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:06:47,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:47,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:06:47,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:47,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:47,809 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-11 20:06:47,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961060358] [2021-03-11 20:06:47,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:06:47,810 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:06:47,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634996870] [2021-03-11 20:06:47,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:06:47,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:06:47,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:06:47,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:06:47,812 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 180 [2021-03-11 20:06:47,812 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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-11 20:06:47,812 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:06:47,812 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 180 [2021-03-11 20:06:47,812 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:06:47,839 INFO L129 PetriNetUnfolder]: 54/140 cut-off events. [2021-03-11 20:06:47,839 INFO L130 PetriNetUnfolder]: For 137/164 co-relation queries the response was YES. [2021-03-11 20:06:47,840 INFO L84 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 140 events. 54/140 cut-off events. For 137/164 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 652 event pairs, 25 based on Foata normal form. 10/137 useless extension candidates. Maximal degree in co-relation 390. Up to 93 conditions per place. [2021-03-11 20:06:47,840 INFO L132 encePairwiseOnDemand]: 177/180 looper letters, 3 selfloop transitions, 3 changer transitions 3/29 dead transitions. [2021-03-11 20:06:47,841 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 134 flow [2021-03-11 20:06:47,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:06:47,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:06:47,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2021-03-11 20:06:47,843 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8611111111111112 [2021-03-11 20:06:47,843 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 465 transitions. [2021-03-11 20:06:47,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 465 transitions. [2021-03-11 20:06:47,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:06:47,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 465 transitions. [2021-03-11 20:06:47,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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-11 20:06:47,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 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-11 20:06:47,846 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 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-11 20:06:47,846 INFO L185 Difference]: Start difference. First operand has 38 places, 29 transitions, 122 flow. Second operand 3 states and 465 transitions. [2021-03-11 20:06:47,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 134 flow [2021-03-11 20:06:47,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 130 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 20:06:47,849 INFO L241 Difference]: Finished difference. Result has 40 places, 26 transitions, 111 flow [2021-03-11 20:06:47,849 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2021-03-11 20:06:47,849 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2021-03-11 20:06:47,849 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 111 flow [2021-03-11 20:06:47,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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-11 20:06:47,850 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:06:47,850 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:06:47,850 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 20:06:47,850 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:06:47,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:06:47,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1509799663, now seen corresponding path program 1 times [2021-03-11 20:06:47,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:06:47,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354178887] [2021-03-11 20:06:47,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:06:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:06:47,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:47,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:47,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:47,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:47,932 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 20:06:47,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:06:47,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:47,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:06:47,944 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-11 20:06:47,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354178887] [2021-03-11 20:06:47,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:06:47,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:06:47,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014018399] [2021-03-11 20:06:47,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:06:47,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:06:47,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:06:47,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:06:47,946 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 180 [2021-03-11 20:06:47,947 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:47,947 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:06:47,947 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 180 [2021-03-11 20:06:47,948 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:06:48,007 INFO L129 PetriNetUnfolder]: 32/100 cut-off events. [2021-03-11 20:06:48,008 INFO L130 PetriNetUnfolder]: For 100/135 co-relation queries the response was YES. [2021-03-11 20:06:48,008 INFO L84 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 100 events. 32/100 cut-off events. For 100/135 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 382 event pairs, 4 based on Foata normal form. 19/112 useless extension candidates. Maximal degree in co-relation 335. Up to 68 conditions per place. [2021-03-11 20:06:48,008 INFO L132 encePairwiseOnDemand]: 174/180 looper letters, 5 selfloop transitions, 7 changer transitions 7/36 dead transitions. [2021-03-11 20:06:48,009 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 36 transitions, 207 flow [2021-03-11 20:06:48,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:06:48,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:06:48,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 879 transitions. [2021-03-11 20:06:48,011 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8138888888888889 [2021-03-11 20:06:48,011 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 879 transitions. [2021-03-11 20:06:48,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 879 transitions. [2021-03-11 20:06:48,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:06:48,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 879 transitions. [2021-03-11 20:06:48,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 146.5) internal successors, (879), 6 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:48,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 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-11 20:06:48,017 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 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-11 20:06:48,017 INFO L185 Difference]: Start difference. First operand has 40 places, 26 transitions, 111 flow. Second operand 6 states and 879 transitions. [2021-03-11 20:06:48,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 36 transitions, 207 flow [2021-03-11 20:06:48,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 36 transitions, 200 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-11 20:06:48,022 INFO L241 Difference]: Finished difference. Result has 44 places, 29 transitions, 160 flow [2021-03-11 20:06:48,022 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2021-03-11 20:06:48,022 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2021-03-11 20:06:48,022 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 160 flow [2021-03-11 20:06:48,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:48,023 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:06:48,023 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:06:48,023 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 20:06:48,023 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:06:48,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:06:48,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1662273608, now seen corresponding path program 1 times [2021-03-11 20:06:48,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:06:48,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061101372] [2021-03-11 20:06:48,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:06:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:06:48,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:48,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:06:48,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:48,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:06:48,156 INFO L142 QuantifierPusher]: treesize reduction 13, result has 53.6 percent of original size [2021-03-11 20:06:48,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-11 20:06:48,174 INFO L142 QuantifierPusher]: treesize reduction 16, result has 54.3 percent of original size [2021-03-11 20:06:48,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 20:06:48,190 INFO L142 QuantifierPusher]: treesize reduction 21, result has 50.0 percent of original size [2021-03-11 20:06:48,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:06:48,215 INFO L142 QuantifierPusher]: treesize reduction 17, result has 55.3 percent of original size [2021-03-11 20:06:48,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:06:48,216 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-11 20:06:48,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061101372] [2021-03-11 20:06:48,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:06:48,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:06:48,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988744614] [2021-03-11 20:06:48,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 20:06:48,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:06:48,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 20:06:48,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-11 20:06:48,219 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 180 [2021-03-11 20:06:48,219 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 29 transitions, 160 flow. Second operand has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 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-11 20:06:48,220 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:06:48,220 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 180 [2021-03-11 20:06:48,220 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:06:48,437 INFO L129 PetriNetUnfolder]: 105/300 cut-off events. [2021-03-11 20:06:48,437 INFO L130 PetriNetUnfolder]: For 642/729 co-relation queries the response was YES. [2021-03-11 20:06:48,438 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1150 conditions, 300 events. 105/300 cut-off events. For 642/729 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1734 event pairs, 9 based on Foata normal form. 21/306 useless extension candidates. Maximal degree in co-relation 1131. Up to 155 conditions per place. [2021-03-11 20:06:48,441 INFO L132 encePairwiseOnDemand]: 172/180 looper letters, 10 selfloop transitions, 13 changer transitions 2/46 dead transitions. [2021-03-11 20:06:48,441 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 271 flow [2021-03-11 20:06:48,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:06:48,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:06:48,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 923 transitions. [2021-03-11 20:06:48,444 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7325396825396825 [2021-03-11 20:06:48,444 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 923 transitions. [2021-03-11 20:06:48,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 923 transitions. [2021-03-11 20:06:48,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:06:48,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 923 transitions. [2021-03-11 20:06:48,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.85714285714286) internal successors, (923), 7 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:48,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 180.0) internal successors, (1440), 8 states have internal predecessors, (1440), 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-11 20:06:48,449 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 180.0) internal successors, (1440), 8 states have internal predecessors, (1440), 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-11 20:06:48,449 INFO L185 Difference]: Start difference. First operand has 44 places, 29 transitions, 160 flow. Second operand 7 states and 923 transitions. [2021-03-11 20:06:48,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 271 flow [2021-03-11 20:06:48,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 229 flow, removed 17 selfloop flow, removed 4 redundant places. [2021-03-11 20:06:48,455 INFO L241 Difference]: Finished difference. Result has 46 places, 39 transitions, 204 flow [2021-03-11 20:06:48,455 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=204, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2021-03-11 20:06:48,455 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 13 predicate places. [2021-03-11 20:06:48,456 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 204 flow [2021-03-11 20:06:48,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 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-11 20:06:48,456 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:06:48,456 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:06:48,456 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 20:06:48,457 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:06:48,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:06:48,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1155411838, now seen corresponding path program 2 times [2021-03-11 20:06:48,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:06:48,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473061007] [2021-03-11 20:06:48,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:06:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:06:48,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:48,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:48,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:48,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:48,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:48,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:48,570 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 20:06:48,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:06:48,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:48,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:06:48,578 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-11 20:06:48,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473061007] [2021-03-11 20:06:48,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:06:48,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:06:48,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983178375] [2021-03-11 20:06:48,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:06:48,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:06:48,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:06:48,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:06:48,582 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 180 [2021-03-11 20:06:48,583 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 204 flow. Second operand has 6 states, 6 states have (on average 143.83333333333334) internal successors, (863), 6 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:48,583 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:06:48,583 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 180 [2021-03-11 20:06:48,583 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:06:48,661 INFO L129 PetriNetUnfolder]: 58/202 cut-off events. [2021-03-11 20:06:48,661 INFO L130 PetriNetUnfolder]: For 286/466 co-relation queries the response was YES. [2021-03-11 20:06:48,662 INFO L84 FinitePrefix]: Finished finitePrefix Result has 723 conditions, 202 events. 58/202 cut-off events. For 286/466 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1048 event pairs, 0 based on Foata normal form. 116/307 useless extension candidates. Maximal degree in co-relation 704. Up to 115 conditions per place. [2021-03-11 20:06:48,663 INFO L132 encePairwiseOnDemand]: 174/180 looper letters, 2 selfloop transitions, 11 changer transitions 5/43 dead transitions. [2021-03-11 20:06:48,663 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 43 transitions, 266 flow [2021-03-11 20:06:48,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:06:48,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:06:48,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1019 transitions. [2021-03-11 20:06:48,666 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8087301587301587 [2021-03-11 20:06:48,666 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1019 transitions. [2021-03-11 20:06:48,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1019 transitions. [2021-03-11 20:06:48,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:06:48,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1019 transitions. [2021-03-11 20:06:48,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 145.57142857142858) internal successors, (1019), 7 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:48,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 180.0) internal successors, (1440), 8 states have internal predecessors, (1440), 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-11 20:06:48,671 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 180.0) internal successors, (1440), 8 states have internal predecessors, (1440), 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-11 20:06:48,671 INFO L185 Difference]: Start difference. First operand has 46 places, 39 transitions, 204 flow. Second operand 7 states and 1019 transitions. [2021-03-11 20:06:48,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 43 transitions, 266 flow [2021-03-11 20:06:48,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 43 transitions, 243 flow, removed 9 selfloop flow, removed 1 redundant places. [2021-03-11 20:06:48,675 INFO L241 Difference]: Finished difference. Result has 54 places, 38 transitions, 219 flow [2021-03-11 20:06:48,675 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=219, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2021-03-11 20:06:48,675 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 21 predicate places. [2021-03-11 20:06:48,675 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 219 flow [2021-03-11 20:06:48,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 143.83333333333334) internal successors, (863), 6 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:48,676 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:06:48,676 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:06:48,676 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 20:06:48,676 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:06:48,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:06:48,677 INFO L82 PathProgramCache]: Analyzing trace with hash -176310096, now seen corresponding path program 1 times [2021-03-11 20:06:48,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:06:48,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792912018] [2021-03-11 20:06:48,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:06:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:06:48,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:48,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:06:48,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:48,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:48,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:06:48,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:06:48,763 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-11 20:06:48,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792912018] [2021-03-11 20:06:48,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:06:48,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:06:48,763 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062916554] [2021-03-11 20:06:48,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:06:48,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:06:48,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:06:48,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:06:48,765 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 180 [2021-03-11 20:06:48,765 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 219 flow. Second operand has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:48,765 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:06:48,765 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 180 [2021-03-11 20:06:48,766 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:06:48,803 INFO L129 PetriNetUnfolder]: 36/148 cut-off events. [2021-03-11 20:06:48,803 INFO L130 PetriNetUnfolder]: For 268/309 co-relation queries the response was YES. [2021-03-11 20:06:48,804 INFO L84 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 148 events. 36/148 cut-off events. For 268/309 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 693 event pairs, 0 based on Foata normal form. 6/148 useless extension candidates. Maximal degree in co-relation 511. Up to 78 conditions per place. [2021-03-11 20:06:48,804 INFO L132 encePairwiseOnDemand]: 177/180 looper letters, 3 selfloop transitions, 1 changer transitions 9/39 dead transitions. [2021-03-11 20:06:48,804 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 39 transitions, 231 flow [2021-03-11 20:06:48,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 20:06:48,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 20:06:48,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 598 transitions. [2021-03-11 20:06:48,807 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8305555555555556 [2021-03-11 20:06:48,807 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 598 transitions. [2021-03-11 20:06:48,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 598 transitions. [2021-03-11 20:06:48,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:06:48,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 598 transitions. [2021-03-11 20:06:48,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.5) internal successors, (598), 4 states have internal predecessors, (598), 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-11 20:06:48,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 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-11 20:06:48,812 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 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-11 20:06:48,812 INFO L185 Difference]: Start difference. First operand has 54 places, 38 transitions, 219 flow. Second operand 4 states and 598 transitions. [2021-03-11 20:06:48,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 39 transitions, 231 flow [2021-03-11 20:06:48,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 39 transitions, 189 flow, removed 11 selfloop flow, removed 8 redundant places. [2021-03-11 20:06:48,816 INFO L241 Difference]: Finished difference. Result has 50 places, 30 transitions, 144 flow [2021-03-11 20:06:48,816 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=50, PETRI_TRANSITIONS=30} [2021-03-11 20:06:48,816 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2021-03-11 20:06:48,816 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 30 transitions, 144 flow [2021-03-11 20:06:48,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:06:48,816 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:06:48,817 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:06:48,817 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 20:06:48,817 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:06:48,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:06:48,817 INFO L82 PathProgramCache]: Analyzing trace with hash 5031744, now seen corresponding path program 2 times [2021-03-11 20:06:48,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:06:48,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923523100] [2021-03-11 20:06:48,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:06:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:06:48,861 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:06:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:06:48,933 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:06:48,959 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 20:06:48,959 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 20:06:48,959 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 20:06:49,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 08:06:49 BasicIcfg [2021-03-11 20:06:49,029 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 20:06:49,030 INFO L168 Benchmark]: Toolchain (without parser) took 18539.13 ms. Allocated memory was 255.9 MB in the beginning and 704.6 MB in the end (delta: 448.8 MB). Free memory was 234.9 MB in the beginning and 651.1 MB in the end (delta: -416.3 MB). Peak memory consumption was 420.5 MB. Max. memory is 16.0 GB. [2021-03-11 20:06:49,030 INFO L168 Benchmark]: CDTParser took 0.11 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-11 20:06:49,031 INFO L168 Benchmark]: CACSL2BoogieTranslator took 531.22 ms. Allocated memory was 255.9 MB in the beginning and 390.1 MB in the end (delta: 134.2 MB). Free memory was 234.3 MB in the beginning and 350.1 MB in the end (delta: -115.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-11 20:06:49,031 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.17 ms. Allocated memory is still 390.1 MB. Free memory was 350.1 MB in the beginning and 346.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-11 20:06:49,031 INFO L168 Benchmark]: Boogie Preprocessor took 43.25 ms. Allocated memory is still 390.1 MB. Free memory was 346.8 MB in the beginning and 344.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:06:49,032 INFO L168 Benchmark]: RCFGBuilder took 2171.74 ms. Allocated memory was 390.1 MB in the beginning and 469.8 MB in the end (delta: 79.7 MB). Free memory was 344.2 MB in the beginning and 416.2 MB in the end (delta: -72.0 MB). Peak memory consumption was 110.3 MB. Max. memory is 16.0 GB. [2021-03-11 20:06:49,032 INFO L168 Benchmark]: TraceAbstraction took 15735.89 ms. Allocated memory was 469.8 MB in the beginning and 704.6 MB in the end (delta: 234.9 MB). Free memory was 416.2 MB in the beginning and 651.1 MB in the end (delta: -234.9 MB). Peak memory consumption was 389.0 MB. Max. memory is 16.0 GB. [2021-03-11 20:06:49,034 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.11 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 531.22 ms. Allocated memory was 255.9 MB in the beginning and 390.1 MB in the end (delta: 134.2 MB). Free memory was 234.3 MB in the beginning and 350.1 MB in the end (delta: -115.8 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 49.17 ms. Allocated memory is still 390.1 MB. Free memory was 350.1 MB in the beginning and 346.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 43.25 ms. Allocated memory is still 390.1 MB. Free memory was 346.8 MB in the beginning and 344.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2171.74 ms. Allocated memory was 390.1 MB in the beginning and 469.8 MB in the end (delta: 79.7 MB). Free memory was 344.2 MB in the beginning and 416.2 MB in the end (delta: -72.0 MB). Peak memory consumption was 110.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 15735.89 ms. Allocated memory was 469.8 MB in the beginning and 704.6 MB in the end (delta: 234.9 MB). Free memory was 416.2 MB in the beginning and 651.1 MB in the end (delta: -234.9 MB). Peak memory consumption was 389.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13407.4ms, 103 PlacesBefore, 33 PlacesAfterwards, 95 TransitionsBefore, 23 TransitionsAfterwards, 1658 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 82 TotalNumberOfCompositions, 4729 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2046, positive: 1862, positive conditional: 0, positive unconditional: 1862, negative: 184, negative conditional: 0, negative unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1130, positive: 1076, positive conditional: 0, positive unconditional: 1076, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1130, positive: 1064, positive conditional: 0, positive unconditional: 1064, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 66, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 968, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 938, negative conditional: 0, negative unconditional: 938, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2046, positive: 786, positive conditional: 0, positive unconditional: 786, negative: 130, negative conditional: 0, negative unconditional: 130, unknown: 1130, unknown conditional: 0, unknown unconditional: 1130] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 83, Positive conditional cache size: 0, Positive unconditional cache size: 83, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L831] 0 pthread_t t766; [L832] FCALL, FORK 0 pthread_create(&t766, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L833] 0 pthread_t t767; [L834] FCALL, FORK 0 pthread_create(&t767, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L835] 0 pthread_t t768; [L836] FCALL, FORK 0 pthread_create(&t768, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1 [L794] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = y [L802] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L764] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L811] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L813] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L842] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L842] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L842] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L843] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L843] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L844] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L844] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L845] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L846] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L849] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L850] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L851] 0 y$flush_delayed = weak$$choice2 [L852] 0 y$mem_tmp = y [L853] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L853] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L854] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L854] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L854] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L854] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L855] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L855] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L855] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L855] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L856] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L856] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L856] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L856] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L857] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L857] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L857] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L857] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L858] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L858] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L858] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L858] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L859] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L859] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L861] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L861] 0 y = y$flush_delayed ? y$mem_tmp : y [L862] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 15551.7ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 764.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 13474.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 28 SDtfs, 15 SDslu, 11 SDs, 0 SdLazy, 150 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 194.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 225.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=219occurred in iteration=8, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 36.8ms SsaConstructionTime, 396.8ms SatisfiabilityAnalysisTime, 590.2ms InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 550 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...