/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/mix036_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 20:08:26,263 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 20:08:26,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 20:08:26,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 20:08:26,290 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 20:08:26,291 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 20:08:26,292 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 20:08:26,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 20:08:26,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 20:08:26,296 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 20:08:26,297 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 20:08:26,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 20:08:26,298 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 20:08:26,299 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 20:08:26,300 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 20:08:26,311 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 20:08:26,312 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 20:08:26,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 20:08:26,314 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 20:08:26,315 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 20:08:26,316 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 20:08:26,317 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 20:08:26,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 20:08:26,319 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 20:08:26,321 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 20:08:26,322 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 20:08:26,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 20:08:26,323 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 20:08:26,323 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 20:08:26,324 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 20:08:26,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 20:08:26,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 20:08:26,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 20:08:26,326 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 20:08:26,327 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 20:08:26,327 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 20:08:26,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 20:08:26,328 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 20:08:26,328 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 20:08:26,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 20:08:26,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 20:08:26,334 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:08:26,369 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 20:08:26,369 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 20:08:26,373 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 20:08:26,373 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 20:08:26,373 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 20:08:26,373 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 20:08:26,373 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 20:08:26,374 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 20:08:26,374 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 20:08:26,374 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 20:08:26,375 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 20:08:26,375 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 20:08:26,375 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 20:08:26,375 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 20:08:26,375 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 20:08:26,376 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 20:08:26,376 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 20:08:26,376 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 20:08:26,376 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 20:08:26,376 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 20:08:26,376 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 20:08:26,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:08:26,377 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 20:08:26,377 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 20:08:26,377 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 20:08:26,377 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 20:08:26,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 20:08:26,378 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 20:08:26,378 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:08:26,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 20:08:26,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 20:08:26,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 20:08:26,706 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 20:08:26,706 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 20:08:26,707 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_power.oepc.i [2021-03-11 20:08:26,770 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/685e3ad0f/2e5ab73106c5449ea359903906e79e18/FLAG5a33c0ecc [2021-03-11 20:08:27,224 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 20:08:27,225 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_power.oepc.i [2021-03-11 20:08:27,241 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/685e3ad0f/2e5ab73106c5449ea359903906e79e18/FLAG5a33c0ecc [2021-03-11 20:08:27,569 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/685e3ad0f/2e5ab73106c5449ea359903906e79e18 [2021-03-11 20:08:27,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 20:08:27,577 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 20:08:27,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 20:08:27,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 20:08:27,581 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 20:08:27,582 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:08:27" (1/1) ... [2021-03-11 20:08:27,583 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54241ffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:08:27, skipping insertion in model container [2021-03-11 20:08:27,583 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:08:27" (1/1) ... [2021-03-11 20:08:27,589 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 20:08:27,636 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 20:08:27,803 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/mix036_power.oepc.i[951,964] [2021-03-11 20:08:28,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:08:28,048 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 20:08:28,057 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/mix036_power.oepc.i[951,964] [2021-03-11 20:08:28,087 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:08:28,146 INFO L208 MainTranslator]: Completed translation [2021-03-11 20:08:28,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:08:28 WrapperNode [2021-03-11 20:08:28,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 20:08:28,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 20:08:28,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 20:08:28,149 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 20:08:28,155 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:08:28" (1/1) ... [2021-03-11 20:08:28,186 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:08:28" (1/1) ... [2021-03-11 20:08:28,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 20:08:28,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 20:08:28,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 20:08:28,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 20:08:28,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:08:28" (1/1) ... [2021-03-11 20:08:28,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:08:28" (1/1) ... [2021-03-11 20:08:28,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:08:28" (1/1) ... [2021-03-11 20:08:28,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:08:28" (1/1) ... [2021-03-11 20:08:28,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:08:28" (1/1) ... [2021-03-11 20:08:28,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:08:28" (1/1) ... [2021-03-11 20:08:28,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:08:28" (1/1) ... [2021-03-11 20:08:28,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 20:08:28,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 20:08:28,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 20:08:28,273 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 20:08:28,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:08:28" (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:08:28,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 20:08:28,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 20:08:28,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 20:08:28,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 20:08:28,319 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 20:08:28,320 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 20:08:28,320 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 20:08:28,320 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 20:08:28,320 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 20:08:28,320 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 20:08:28,320 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-11 20:08:28,320 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-11 20:08:28,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 20:08:28,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 20:08:28,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 20:08:28,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 20:08:28,322 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:08:30,213 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 20:08:30,213 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 20:08:30,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:08:30 BoogieIcfgContainer [2021-03-11 20:08:30,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 20:08:30,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 20:08:30,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 20:08:30,220 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 20:08:30,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 08:08:27" (1/3) ... [2021-03-11 20:08:30,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79861b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:08:30, skipping insertion in model container [2021-03-11 20:08:30,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:08:28" (2/3) ... [2021-03-11 20:08:30,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79861b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:08:30, skipping insertion in model container [2021-03-11 20:08:30,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:08:30" (3/3) ... [2021-03-11 20:08:30,223 INFO L111 eAbstractionObserver]: Analyzing ICFG mix036_power.oepc.i [2021-03-11 20:08:30,229 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 20:08:30,231 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 20:08:30,232 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 20:08:30,273 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,274 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,274 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,274 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,274 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,274 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,275 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,275 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,275 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,275 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,275 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,275 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,275 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,280 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,280 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,281 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,281 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,281 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,282 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,282 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,282 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,282 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,282 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,283 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,283 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,283 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,283 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,283 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,283 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,285 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,285 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,285 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,286 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,289 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,289 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,290 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,290 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,290 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,290 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,290 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,290 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,290 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,290 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,290 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,291 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,291 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,294 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,294 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,295 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,295 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,302 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,303 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,305 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,305 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,305 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,305 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,305 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,305 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,305 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,305 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,305 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,305 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,305 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,305 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,307 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,307 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,307 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,307 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,307 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,311 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,311 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,311 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,313 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,314 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,315 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,316 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,316 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,316 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,316 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,316 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,316 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,316 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,316 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,316 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,317 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,317 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,317 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,317 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,317 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,317 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,317 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,317 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,318 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,319 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,325 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,325 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,326 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,327 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,327 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,329 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,329 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,341 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,341 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:08:30,342 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 20:08:30,358 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-11 20:08:30,383 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 20:08:30,383 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 20:08:30,383 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 20:08:30,383 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 20:08:30,383 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 20:08:30,383 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 20:08:30,383 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 20:08:30,384 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 20:08:30,395 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 132 places, 121 transitions, 262 flow [2021-03-11 20:08:30,472 INFO L129 PetriNetUnfolder]: 2/117 cut-off events. [2021-03-11 20:08:30,472 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:08:30,477 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 91 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-11 20:08:30,477 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 121 transitions, 262 flow [2021-03-11 20:08:30,481 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 117 transitions, 246 flow [2021-03-11 20:08:30,484 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 20:08:30,491 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 117 transitions, 246 flow [2021-03-11 20:08:30,493 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 117 transitions, 246 flow [2021-03-11 20:08:30,494 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 246 flow [2021-03-11 20:08:30,513 INFO L129 PetriNetUnfolder]: 2/117 cut-off events. [2021-03-11 20:08:30,513 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:08:30,514 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 92 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-11 20:08:30,517 INFO L116 LiptonReduction]: Number of co-enabled transitions 2876 [2021-03-11 20:08:34,774 WARN L205 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2021-03-11 20:08:34,984 WARN L205 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-03-11 20:08:35,360 WARN L205 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2021-03-11 20:08:35,518 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2021-03-11 20:08:35,522 INFO L131 LiptonReduction]: Checked pairs total: 8321 [2021-03-11 20:08:35,522 INFO L133 LiptonReduction]: Total number of compositions: 95 [2021-03-11 20:08:35,523 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5041 [2021-03-11 20:08:35,531 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-03-11 20:08:35,531 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:08:35,531 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:08:35,531 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-03-11 20:08:35,532 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:08:35,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:08:35,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1221224, now seen corresponding path program 1 times [2021-03-11 20:08:35,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:08:35,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785389308] [2021-03-11 20:08:35,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:08:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:08:35,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:08:35,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:08:35,727 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:08:35,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785389308] [2021-03-11 20:08:35,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:08:35,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:08:35,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381159032] [2021-03-11 20:08:35,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:08:35,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:08:35,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:08:35,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:08:35,746 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 216 [2021-03-11 20:08:35,749 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 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:08:35,749 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:08:35,749 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 216 [2021-03-11 20:08:35,750 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:08:35,866 INFO L129 PetriNetUnfolder]: 133/316 cut-off events. [2021-03-11 20:08:35,866 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:08:35,869 INFO L84 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 316 events. 133/316 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1669 event pairs, 110 based on Foata normal form. 33/322 useless extension candidates. Maximal degree in co-relation 524. Up to 153 conditions per place. [2021-03-11 20:08:35,872 INFO L132 encePairwiseOnDemand]: 212/216 looper letters, 11 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2021-03-11 20:08:35,872 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 108 flow [2021-03-11 20:08:35,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:08:35,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:08:35,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions. [2021-03-11 20:08:35,888 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8950617283950617 [2021-03-11 20:08:35,889 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 580 transitions. [2021-03-11 20:08:35,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 580 transitions. [2021-03-11 20:08:35,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:08:35,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 580 transitions. [2021-03-11 20:08:35,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 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:08:35,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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:08:35,908 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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:08:35,909 INFO L185 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 580 transitions. [2021-03-11 20:08:35,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 108 flow [2021-03-11 20:08:35,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 35 transitions, 104 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-11 20:08:35,913 INFO L241 Difference]: Finished difference. Result has 41 places, 30 transitions, 72 flow [2021-03-11 20:08:35,914 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2021-03-11 20:08:35,915 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2021-03-11 20:08:35,915 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 72 flow [2021-03-11 20:08:35,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 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:08:35,918 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:08:35,918 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:08:35,920 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 20:08:35,921 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:08:35,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:08:35,922 INFO L82 PathProgramCache]: Analyzing trace with hash -661033102, now seen corresponding path program 1 times [2021-03-11 20:08:35,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:08:35,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005016789] [2021-03-11 20:08:35,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:08:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:08:36,063 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-11 20:08:36,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:08:36,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:08:36,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:08:36,083 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:08:36,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005016789] [2021-03-11 20:08:36,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:08:36,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:08:36,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444565079] [2021-03-11 20:08:36,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:08:36,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:08:36,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:08:36,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:08:36,086 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 216 [2021-03-11 20:08:36,086 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 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:08:36,087 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:08:36,087 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 216 [2021-03-11 20:08:36,087 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:08:36,187 INFO L129 PetriNetUnfolder]: 254/546 cut-off events. [2021-03-11 20:08:36,187 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:08:36,189 INFO L84 FinitePrefix]: Finished finitePrefix Result has 954 conditions, 546 events. 254/546 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3161 event pairs, 137 based on Foata normal form. 0/513 useless extension candidates. Maximal degree in co-relation 945. Up to 266 conditions per place. [2021-03-11 20:08:36,190 INFO L132 encePairwiseOnDemand]: 209/216 looper letters, 7 selfloop transitions, 5 changer transitions 13/46 dead transitions. [2021-03-11 20:08:36,191 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 154 flow [2021-03-11 20:08:36,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:08:36,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:08:36,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 877 transitions. [2021-03-11 20:08:36,194 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.812037037037037 [2021-03-11 20:08:36,194 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 877 transitions. [2021-03-11 20:08:36,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 877 transitions. [2021-03-11 20:08:36,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:08:36,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 877 transitions. [2021-03-11 20:08:36,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 175.4) internal successors, (877), 5 states have internal predecessors, (877), 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:08:36,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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:08:36,199 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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:08:36,199 INFO L185 Difference]: Start difference. First operand has 41 places, 30 transitions, 72 flow. Second operand 5 states and 877 transitions. [2021-03-11 20:08:36,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 154 flow [2021-03-11 20:08:36,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:08:36,200 INFO L241 Difference]: Finished difference. Result has 46 places, 33 transitions, 111 flow [2021-03-11 20:08:36,201 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2021-03-11 20:08:36,201 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2021-03-11 20:08:36,201 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 111 flow [2021-03-11 20:08:36,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 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:08:36,202 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:08:36,202 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:08:36,202 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 20:08:36,202 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:08:36,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:08:36,202 INFO L82 PathProgramCache]: Analyzing trace with hash -563720866, now seen corresponding path program 1 times [2021-03-11 20:08:36,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:08:36,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160189024] [2021-03-11 20:08:36,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:08:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:08:36,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:08:36,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:08:36,282 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-11 20:08:36,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:08:36,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:08:36,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:08:36,321 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:08:36,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160189024] [2021-03-11 20:08:36,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:08:36,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:08:36,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817737992] [2021-03-11 20:08:36,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:08:36,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:08:36,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:08:36,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:08:36,324 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 216 [2021-03-11 20:08:36,325 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 170.8) internal successors, (854), 5 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:08:36,325 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:08:36,325 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 216 [2021-03-11 20:08:36,326 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:08:36,398 INFO L129 PetriNetUnfolder]: 120/254 cut-off events. [2021-03-11 20:08:36,398 INFO L130 PetriNetUnfolder]: For 224/305 co-relation queries the response was YES. [2021-03-11 20:08:36,399 INFO L84 FinitePrefix]: Finished finitePrefix Result has 773 conditions, 254 events. 120/254 cut-off events. For 224/305 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1083 event pairs, 17 based on Foata normal form. 21/266 useless extension candidates. Maximal degree in co-relation 761. Up to 150 conditions per place. [2021-03-11 20:08:36,401 INFO L132 encePairwiseOnDemand]: 212/216 looper letters, 12 selfloop transitions, 3 changer transitions 9/45 dead transitions. [2021-03-11 20:08:36,401 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 225 flow [2021-03-11 20:08:36,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:08:36,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:08:36,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 872 transitions. [2021-03-11 20:08:36,403 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8074074074074075 [2021-03-11 20:08:36,403 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 872 transitions. [2021-03-11 20:08:36,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 872 transitions. [2021-03-11 20:08:36,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:08:36,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 872 transitions. [2021-03-11 20:08:36,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 174.4) internal successors, (872), 5 states have internal predecessors, (872), 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:08:36,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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:08:36,408 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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:08:36,408 INFO L185 Difference]: Start difference. First operand has 46 places, 33 transitions, 111 flow. Second operand 5 states and 872 transitions. [2021-03-11 20:08:36,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 225 flow [2021-03-11 20:08:36,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 45 transitions, 218 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-11 20:08:36,412 INFO L241 Difference]: Finished difference. Result has 48 places, 33 transitions, 119 flow [2021-03-11 20:08:36,412 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2021-03-11 20:08:36,412 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2021-03-11 20:08:36,412 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 119 flow [2021-03-11 20:08:36,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 170.8) internal successors, (854), 5 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:08:36,413 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:08:36,413 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:08:36,413 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 20:08:36,413 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:08:36,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:08:36,414 INFO L82 PathProgramCache]: Analyzing trace with hash -368633390, now seen corresponding path program 1 times [2021-03-11 20:08:36,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:08:36,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371505707] [2021-03-11 20:08:36,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:08:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:08:36,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:08:36,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:08:36,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:08:36,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:08:36,506 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:08:36,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371505707] [2021-03-11 20:08:36,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:08:36,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:08:36,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859874740] [2021-03-11 20:08:36,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:08:36,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:08:36,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:08:36,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:08:36,508 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 216 [2021-03-11 20:08:36,509 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 33 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 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:08:36,509 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:08:36,509 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 216 [2021-03-11 20:08:36,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:08:36,556 INFO L129 PetriNetUnfolder]: 191/437 cut-off events. [2021-03-11 20:08:36,556 INFO L130 PetriNetUnfolder]: For 216/226 co-relation queries the response was YES. [2021-03-11 20:08:36,558 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 437 events. 191/437 cut-off events. For 216/226 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2529 event pairs, 96 based on Foata normal form. 1/402 useless extension candidates. Maximal degree in co-relation 1018. Up to 206 conditions per place. [2021-03-11 20:08:36,560 INFO L132 encePairwiseOnDemand]: 210/216 looper letters, 5 selfloop transitions, 5 changer transitions 0/37 dead transitions. [2021-03-11 20:08:36,560 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 37 transitions, 147 flow [2021-03-11 20:08:36,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:08:36,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:08:36,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions. [2021-03-11 20:08:36,562 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8641975308641975 [2021-03-11 20:08:36,562 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 560 transitions. [2021-03-11 20:08:36,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 560 transitions. [2021-03-11 20:08:36,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:08:36,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 560 transitions. [2021-03-11 20:08:36,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 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:08:36,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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:08:36,566 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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:08:36,566 INFO L185 Difference]: Start difference. First operand has 48 places, 33 transitions, 119 flow. Second operand 3 states and 560 transitions. [2021-03-11 20:08:36,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 37 transitions, 147 flow [2021-03-11 20:08:36,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 37 transitions, 137 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-11 20:08:36,569 INFO L241 Difference]: Finished difference. Result has 45 places, 37 transitions, 142 flow [2021-03-11 20:08:36,569 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2021-03-11 20:08:36,569 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2021-03-11 20:08:36,569 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 142 flow [2021-03-11 20:08:36,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 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:08:36,569 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:08:36,570 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:08:36,570 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 20:08:36,570 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:08:36,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:08:36,570 INFO L82 PathProgramCache]: Analyzing trace with hash 2101189319, now seen corresponding path program 1 times [2021-03-11 20:08:36,570 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:08:36,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476380132] [2021-03-11 20:08:36,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:08:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:08:36,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:08:36,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:08:36,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:08:36,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:08:36,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:08:36,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:08:36,687 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:08:36,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476380132] [2021-03-11 20:08:36,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:08:36,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:08:36,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666501473] [2021-03-11 20:08:36,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:08:36,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:08:36,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:08:36,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:08:36,690 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 216 [2021-03-11 20:08:36,691 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 183.75) internal successors, (735), 4 states have internal predecessors, (735), 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:08:36,691 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:08:36,691 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 216 [2021-03-11 20:08:36,691 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:08:36,742 INFO L129 PetriNetUnfolder]: 110/286 cut-off events. [2021-03-11 20:08:36,742 INFO L130 PetriNetUnfolder]: For 97/151 co-relation queries the response was YES. [2021-03-11 20:08:36,743 INFO L84 FinitePrefix]: Finished finitePrefix Result has 771 conditions, 286 events. 110/286 cut-off events. For 97/151 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1467 event pairs, 35 based on Foata normal form. 36/306 useless extension candidates. Maximal degree in co-relation 757. Up to 136 conditions per place. [2021-03-11 20:08:36,745 INFO L132 encePairwiseOnDemand]: 210/216 looper letters, 5 selfloop transitions, 9 changer transitions 0/41 dead transitions. [2021-03-11 20:08:36,745 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 186 flow [2021-03-11 20:08:36,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 20:08:36,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 20:08:36,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 747 transitions. [2021-03-11 20:08:36,747 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8645833333333334 [2021-03-11 20:08:36,747 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 747 transitions. [2021-03-11 20:08:36,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 747 transitions. [2021-03-11 20:08:36,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:08:36,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 747 transitions. [2021-03-11 20:08:36,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 186.75) internal successors, (747), 4 states have internal predecessors, (747), 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:08:36,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 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:08:36,751 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 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:08:36,751 INFO L185 Difference]: Start difference. First operand has 45 places, 37 transitions, 142 flow. Second operand 4 states and 747 transitions. [2021-03-11 20:08:36,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 186 flow [2021-03-11 20:08:36,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 41 transitions, 181 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 20:08:36,754 INFO L241 Difference]: Finished difference. Result has 48 places, 41 transitions, 189 flow [2021-03-11 20:08:36,755 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2021-03-11 20:08:36,755 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2021-03-11 20:08:36,755 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 189 flow [2021-03-11 20:08:36,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 183.75) internal successors, (735), 4 states have internal predecessors, (735), 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:08:36,755 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:08:36,755 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:08:36,755 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 20:08:36,756 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:08:36,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:08:36,756 INFO L82 PathProgramCache]: Analyzing trace with hash -2126572270, now seen corresponding path program 1 times [2021-03-11 20:08:36,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:08:36,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274141670] [2021-03-11 20:08:36,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:08:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:08:36,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:08:36,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:08:36,888 INFO L142 QuantifierPusher]: treesize reduction 9, result has 70.0 percent of original size [2021-03-11 20:08:36,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:08:36,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:08:36,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:08:36,914 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-11 20:08:36,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:08:36,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:08:36,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:08:36,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:08:36,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274141670] [2021-03-11 20:08:36,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:08:36,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:08:36,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707429070] [2021-03-11 20:08:36,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 20:08:36,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:08:36,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 20:08:36,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-11 20:08:36,939 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 216 [2021-03-11 20:08:36,940 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 189 flow. Second operand has 7 states, 7 states have (on average 145.42857142857142) internal successors, (1018), 7 states have internal predecessors, (1018), 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:08:36,940 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:08:36,940 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 216 [2021-03-11 20:08:36,940 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:08:37,498 INFO L129 PetriNetUnfolder]: 1216/2265 cut-off events. [2021-03-11 20:08:37,498 INFO L130 PetriNetUnfolder]: For 1540/2267 co-relation queries the response was YES. [2021-03-11 20:08:37,507 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6740 conditions, 2265 events. 1216/2265 cut-off events. For 1540/2267 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 15437 event pairs, 241 based on Foata normal form. 117/2259 useless extension candidates. Maximal degree in co-relation 6724. Up to 835 conditions per place. [2021-03-11 20:08:37,519 INFO L132 encePairwiseOnDemand]: 203/216 looper letters, 38 selfloop transitions, 28 changer transitions 4/93 dead transitions. [2021-03-11 20:08:37,519 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 93 transitions, 524 flow [2021-03-11 20:08:37,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-11 20:08:37,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-11 20:08:37,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1655 transitions. [2021-03-11 20:08:37,523 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.6965488215488216 [2021-03-11 20:08:37,523 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1655 transitions. [2021-03-11 20:08:37,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1655 transitions. [2021-03-11 20:08:37,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:08:37,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1655 transitions. [2021-03-11 20:08:37,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 150.45454545454547) internal successors, (1655), 11 states have internal predecessors, (1655), 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:08:37,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 216.0) internal successors, (2592), 12 states have internal predecessors, (2592), 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:08:37,531 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 216.0) internal successors, (2592), 12 states have internal predecessors, (2592), 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:08:37,531 INFO L185 Difference]: Start difference. First operand has 48 places, 41 transitions, 189 flow. Second operand 11 states and 1655 transitions. [2021-03-11 20:08:37,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 93 transitions, 524 flow [2021-03-11 20:08:37,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 93 transitions, 506 flow, removed 4 selfloop flow, removed 2 redundant places. [2021-03-11 20:08:37,536 INFO L241 Difference]: Finished difference. Result has 63 places, 64 transitions, 388 flow [2021-03-11 20:08:37,536 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=388, PETRI_PLACES=63, PETRI_TRANSITIONS=64} [2021-03-11 20:08:37,536 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2021-03-11 20:08:37,536 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 64 transitions, 388 flow [2021-03-11 20:08:37,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 145.42857142857142) internal successors, (1018), 7 states have internal predecessors, (1018), 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:08:37,537 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:08:37,537 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:08:37,537 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 20:08:37,537 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:08:37,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:08:37,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1714394770, now seen corresponding path program 2 times [2021-03-11 20:08:37,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:08:37,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690512359] [2021-03-11 20:08:37,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:08:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:08:37,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:08:37,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:08:37,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:08:37,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:08:37,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:08:37,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:08:37,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:08:37,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:08:37,671 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:08:37,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690512359] [2021-03-11 20:08:37,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:08:37,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:08:37,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618386821] [2021-03-11 20:08:37,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:08:37,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:08:37,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:08:37,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:08:37,673 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 216 [2021-03-11 20:08:37,674 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 64 transitions, 388 flow. Second operand has 5 states, 5 states have (on average 183.8) internal successors, (919), 5 states have internal predecessors, (919), 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:08:37,674 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:08:37,674 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 216 [2021-03-11 20:08:37,674 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:08:37,785 INFO L129 PetriNetUnfolder]: 319/791 cut-off events. [2021-03-11 20:08:37,785 INFO L130 PetriNetUnfolder]: For 1249/1923 co-relation queries the response was YES. [2021-03-11 20:08:37,789 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2800 conditions, 791 events. 319/791 cut-off events. For 1249/1923 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5118 event pairs, 43 based on Foata normal form. 351/1086 useless extension candidates. Maximal degree in co-relation 2777. Up to 365 conditions per place. [2021-03-11 20:08:37,793 INFO L132 encePairwiseOnDemand]: 210/216 looper letters, 5 selfloop transitions, 13 changer transitions 3/68 dead transitions. [2021-03-11 20:08:37,793 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 68 transitions, 448 flow [2021-03-11 20:08:37,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:08:37,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:08:37,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 934 transitions. [2021-03-11 20:08:37,796 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8648148148148148 [2021-03-11 20:08:37,796 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 934 transitions. [2021-03-11 20:08:37,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 934 transitions. [2021-03-11 20:08:37,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:08:37,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 934 transitions. [2021-03-11 20:08:37,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 186.8) internal successors, (934), 5 states have internal predecessors, (934), 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:08:37,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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:08:37,801 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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:08:37,802 INFO L185 Difference]: Start difference. First operand has 63 places, 64 transitions, 388 flow. Second operand 5 states and 934 transitions. [2021-03-11 20:08:37,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 68 transitions, 448 flow [2021-03-11 20:08:37,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 68 transitions, 425 flow, removed 11 selfloop flow, removed 2 redundant places. [2021-03-11 20:08:37,809 INFO L241 Difference]: Finished difference. Result has 65 places, 65 transitions, 411 flow [2021-03-11 20:08:37,809 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=411, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2021-03-11 20:08:37,809 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places. [2021-03-11 20:08:37,809 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 411 flow [2021-03-11 20:08:37,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 183.8) internal successors, (919), 5 states have internal predecessors, (919), 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:08:37,810 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:08:37,810 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, 1, 1, 1, 1] [2021-03-11 20:08:37,810 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 20:08:37,810 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:08:37,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:08:37,811 INFO L82 PathProgramCache]: Analyzing trace with hash 2069047381, now seen corresponding path program 1 times [2021-03-11 20:08:37,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:08:37,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226580569] [2021-03-11 20:08:37,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:08:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:08:37,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:08:37,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:08:37,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:08:37,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:08:37,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:08:37,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:08:37,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:08:37,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:08:37,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:08:37,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:08:37,910 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:08:37,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226580569] [2021-03-11 20:08:37,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:08:37,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:08:37,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17020556] [2021-03-11 20:08:37,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:08:37,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:08:37,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:08:37,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:08:37,913 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 216 [2021-03-11 20:08:37,914 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 411 flow. Second operand has 6 states, 6 states have (on average 183.83333333333334) internal successors, (1103), 6 states have internal predecessors, (1103), 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:08:37,914 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:08:37,914 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 216 [2021-03-11 20:08:37,914 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:08:38,026 INFO L129 PetriNetUnfolder]: 273/650 cut-off events. [2021-03-11 20:08:38,026 INFO L130 PetriNetUnfolder]: For 1940/2772 co-relation queries the response was YES. [2021-03-11 20:08:38,030 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2729 conditions, 650 events. 273/650 cut-off events. For 1940/2772 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4094 event pairs, 32 based on Foata normal form. 342/938 useless extension candidates. Maximal degree in co-relation 2710. Up to 310 conditions per place. [2021-03-11 20:08:38,033 INFO L132 encePairwiseOnDemand]: 210/216 looper letters, 1 selfloop transitions, 17 changer transitions 2/64 dead transitions. [2021-03-11 20:08:38,033 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 64 transitions, 442 flow [2021-03-11 20:08:38,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:08:38,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:08:38,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1117 transitions. [2021-03-11 20:08:38,036 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8618827160493827 [2021-03-11 20:08:38,036 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1117 transitions. [2021-03-11 20:08:38,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1117 transitions. [2021-03-11 20:08:38,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:08:38,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1117 transitions. [2021-03-11 20:08:38,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 186.16666666666666) internal successors, (1117), 6 states have internal predecessors, (1117), 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:08:38,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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:08:38,041 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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:08:38,041 INFO L185 Difference]: Start difference. First operand has 65 places, 65 transitions, 411 flow. Second operand 6 states and 1117 transitions. [2021-03-11 20:08:38,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 64 transitions, 442 flow [2021-03-11 20:08:38,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 64 transitions, 388 flow, removed 16 selfloop flow, removed 6 redundant places. [2021-03-11 20:08:38,051 INFO L241 Difference]: Finished difference. Result has 63 places, 62 transitions, 386 flow [2021-03-11 20:08:38,051 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=386, PETRI_PLACES=63, PETRI_TRANSITIONS=62} [2021-03-11 20:08:38,051 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2021-03-11 20:08:38,051 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 386 flow [2021-03-11 20:08:38,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 183.83333333333334) internal successors, (1103), 6 states have internal predecessors, (1103), 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:08:38,052 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:08:38,052 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:08:38,052 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 20:08:38,052 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:08:38,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:08:38,052 INFO L82 PathProgramCache]: Analyzing trace with hash -394380003, now seen corresponding path program 1 times [2021-03-11 20:08:38,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:08:38,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287451969] [2021-03-11 20:08:38,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:08:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:08:38,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:08:38,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:08:38,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:08:38,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:08:38,165 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-11 20:08:38,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:08:38,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:08:38,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:08:38,185 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:08:38,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287451969] [2021-03-11 20:08:38,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:08:38,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:08:38,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827616146] [2021-03-11 20:08:38,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:08:38,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:08:38,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:08:38,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:08:38,189 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 216 [2021-03-11 20:08:38,190 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 62 transitions, 386 flow. Second operand has 5 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 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:08:38,190 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:08:38,190 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 216 [2021-03-11 20:08:38,190 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:08:38,337 INFO L129 PetriNetUnfolder]: 442/995 cut-off events. [2021-03-11 20:08:38,337 INFO L130 PetriNetUnfolder]: For 1888/2050 co-relation queries the response was YES. [2021-03-11 20:08:38,342 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3706 conditions, 995 events. 442/995 cut-off events. For 1888/2050 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6691 event pairs, 24 based on Foata normal form. 32/964 useless extension candidates. Maximal degree in co-relation 3684. Up to 280 conditions per place. [2021-03-11 20:08:38,347 INFO L132 encePairwiseOnDemand]: 207/216 looper letters, 14 selfloop transitions, 20 changer transitions 2/77 dead transitions. [2021-03-11 20:08:38,347 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 77 transitions, 557 flow [2021-03-11 20:08:38,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:08:38,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:08:38,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 989 transitions. [2021-03-11 20:08:38,350 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7631172839506173 [2021-03-11 20:08:38,350 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 989 transitions. [2021-03-11 20:08:38,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 989 transitions. [2021-03-11 20:08:38,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:08:38,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 989 transitions. [2021-03-11 20:08:38,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 164.83333333333334) internal successors, (989), 6 states have internal predecessors, (989), 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:08:38,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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:08:38,355 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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:08:38,355 INFO L185 Difference]: Start difference. First operand has 63 places, 62 transitions, 386 flow. Second operand 6 states and 989 transitions. [2021-03-11 20:08:38,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 77 transitions, 557 flow [2021-03-11 20:08:38,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 77 transitions, 483 flow, removed 24 selfloop flow, removed 5 redundant places. [2021-03-11 20:08:38,369 INFO L241 Difference]: Finished difference. Result has 67 places, 73 transitions, 483 flow [2021-03-11 20:08:38,369 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=483, PETRI_PLACES=67, PETRI_TRANSITIONS=73} [2021-03-11 20:08:38,369 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 23 predicate places. [2021-03-11 20:08:38,369 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 73 transitions, 483 flow [2021-03-11 20:08:38,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 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:08:38,370 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:08:38,370 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:08:38,370 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 20:08:38,370 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:08:38,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:08:38,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1140530617, now seen corresponding path program 2 times [2021-03-11 20:08:38,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:08:38,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849454433] [2021-03-11 20:08:38,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:08:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:08:38,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:08:38,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:08:38,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:08:38,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:08:38,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:08:38,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:08:38,476 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-03-11 20:08:38,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 20:08:38,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:08:38,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:08:38,494 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:08:38,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849454433] [2021-03-11 20:08:38,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:08:38,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:08:38,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989837072] [2021-03-11 20:08:38,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:08:38,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:08:38,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:08:38,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:08:38,498 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 216 [2021-03-11 20:08:38,499 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 73 transitions, 483 flow. Second operand has 6 states, 6 states have (on average 163.5) internal successors, (981), 6 states have internal predecessors, (981), 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:08:38,499 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:08:38,499 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 216 [2021-03-11 20:08:38,499 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:08:38,773 INFO L129 PetriNetUnfolder]: 826/1847 cut-off events. [2021-03-11 20:08:38,773 INFO L130 PetriNetUnfolder]: For 2843/3085 co-relation queries the response was YES. [2021-03-11 20:08:38,783 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6263 conditions, 1847 events. 826/1847 cut-off events. For 2843/3085 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 14546 event pairs, 43 based on Foata normal form. 58/1792 useless extension candidates. Maximal degree in co-relation 6244. Up to 487 conditions per place. [2021-03-11 20:08:38,789 INFO L132 encePairwiseOnDemand]: 208/216 looper letters, 30 selfloop transitions, 24 changer transitions 4/100 dead transitions. [2021-03-11 20:08:38,789 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 824 flow [2021-03-11 20:08:38,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:08:38,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:08:38,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1161 transitions. [2021-03-11 20:08:38,792 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7678571428571429 [2021-03-11 20:08:38,792 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1161 transitions. [2021-03-11 20:08:38,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1161 transitions. [2021-03-11 20:08:38,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:08:38,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1161 transitions. [2021-03-11 20:08:38,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 165.85714285714286) internal successors, (1161), 7 states have internal predecessors, (1161), 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:08:38,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 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:08:38,802 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 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:08:38,802 INFO L185 Difference]: Start difference. First operand has 67 places, 73 transitions, 483 flow. Second operand 7 states and 1161 transitions. [2021-03-11 20:08:38,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 100 transitions, 824 flow [2021-03-11 20:08:38,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 100 transitions, 822 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-11 20:08:38,849 INFO L241 Difference]: Finished difference. Result has 74 places, 81 transitions, 631 flow [2021-03-11 20:08:38,849 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=631, PETRI_PLACES=74, PETRI_TRANSITIONS=81} [2021-03-11 20:08:38,849 INFO L335 CegarLoopForPetriNet]: 44 programPoint places, 30 predicate places. [2021-03-11 20:08:38,849 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 631 flow [2021-03-11 20:08:38,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 163.5) internal successors, (981), 6 states have internal predecessors, (981), 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:08:38,850 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:08:38,851 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:08:38,851 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 20:08:38,851 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:08:38,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:08:38,851 INFO L82 PathProgramCache]: Analyzing trace with hash -361372697, now seen corresponding path program 3 times [2021-03-11 20:08:38,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:08:38,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291601529] [2021-03-11 20:08:38,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:08:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:08:38,915 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:08:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:08:38,989 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:08:39,031 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 20:08:39,031 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 20:08:39,031 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 20:08:39,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 08:08:39 BasicIcfg [2021-03-11 20:08:39,142 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 20:08:39,143 INFO L168 Benchmark]: Toolchain (without parser) took 11569.55 ms. Allocated memory was 255.9 MB in the beginning and 612.4 MB in the end (delta: 356.5 MB). Free memory was 233.4 MB in the beginning and 424.2 MB in the end (delta: -190.7 MB). Peak memory consumption was 166.8 MB. Max. memory is 16.0 GB. [2021-03-11 20:08:39,143 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 255.9 MB. Free memory is still 238.2 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 20:08:39,143 INFO L168 Benchmark]: CACSL2BoogieTranslator took 569.09 ms. Allocated memory was 255.9 MB in the beginning and 362.8 MB in the end (delta: 107.0 MB). Free memory was 232.8 MB in the beginning and 323.1 MB in the end (delta: -90.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. [2021-03-11 20:08:39,144 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.31 ms. Allocated memory is still 362.8 MB. Free memory was 323.1 MB in the beginning and 320.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:08:39,144 INFO L168 Benchmark]: Boogie Preprocessor took 49.12 ms. Allocated memory is still 362.8 MB. Free memory was 320.4 MB in the beginning and 318.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:08:39,144 INFO L168 Benchmark]: RCFGBuilder took 1943.59 ms. Allocated memory is still 362.8 MB. Free memory was 317.6 MB in the beginning and 267.5 MB in the end (delta: 50.1 MB). Peak memory consumption was 60.6 MB. Max. memory is 16.0 GB. [2021-03-11 20:08:39,145 INFO L168 Benchmark]: TraceAbstraction took 8924.12 ms. Allocated memory was 362.8 MB in the beginning and 612.4 MB in the end (delta: 249.6 MB). Free memory was 267.5 MB in the beginning and 424.2 MB in the end (delta: -156.7 MB). Peak memory consumption was 92.9 MB. Max. memory is 16.0 GB. [2021-03-11 20:08:39,146 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.2 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 569.09 ms. Allocated memory was 255.9 MB in the beginning and 362.8 MB in the end (delta: 107.0 MB). Free memory was 232.8 MB in the beginning and 323.1 MB in the end (delta: -90.3 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 74.31 ms. Allocated memory is still 362.8 MB. Free memory was 323.1 MB in the beginning and 320.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 49.12 ms. Allocated memory is still 362.8 MB. Free memory was 320.4 MB in the beginning and 318.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1943.59 ms. Allocated memory is still 362.8 MB. Free memory was 317.6 MB in the beginning and 267.5 MB in the end (delta: 50.1 MB). Peak memory consumption was 60.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 8924.12 ms. Allocated memory was 362.8 MB in the beginning and 612.4 MB in the end (delta: 249.6 MB). Free memory was 267.5 MB in the beginning and 424.2 MB in the end (delta: -156.7 MB). Peak memory consumption was 92.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5028.4ms, 128 PlacesBefore, 44 PlacesAfterwards, 117 TransitionsBefore, 32 TransitionsAfterwards, 2876 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 95 TotalNumberOfCompositions, 8321 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4643, positive: 4414, positive conditional: 0, positive unconditional: 4414, negative: 229, negative conditional: 0, negative unconditional: 229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2076, positive: 2025, positive conditional: 0, positive unconditional: 2025, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2076, positive: 1986, positive conditional: 0, positive unconditional: 1986, negative: 90, negative conditional: 0, negative unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 90, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 560, positive: 99, positive conditional: 0, positive unconditional: 99, negative: 461, negative conditional: 0, negative unconditional: 461, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4643, positive: 2389, positive conditional: 0, positive unconditional: 2389, negative: 178, negative conditional: 0, negative unconditional: 178, unknown: 2076, unknown conditional: 0, unknown unconditional: 2076] , Statistics on independence cache: Total cache size (in pairs): 340, Positive cache size: 316, Positive conditional cache size: 0, Positive unconditional cache size: 316, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool b$flush_delayed; [L726] 0 int b$mem_tmp; [L727] 0 _Bool b$r_buff0_thd0; [L728] 0 _Bool b$r_buff0_thd1; [L729] 0 _Bool b$r_buff0_thd2; [L730] 0 _Bool b$r_buff0_thd3; [L731] 0 _Bool b$r_buff0_thd4; [L732] 0 _Bool b$r_buff1_thd0; [L733] 0 _Bool b$r_buff1_thd1; [L734] 0 _Bool b$r_buff1_thd2; [L735] 0 _Bool b$r_buff1_thd3; [L736] 0 _Bool b$r_buff1_thd4; [L737] 0 _Bool b$read_delayed; [L738] 0 int *b$read_delayed_var; [L739] 0 int b$w_buff0; [L740] 0 _Bool b$w_buff0_used; [L741] 0 int b$w_buff1; [L742] 0 _Bool b$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t937; [L874] FCALL, FORK 0 pthread_create(&t937, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t938; [L876] FCALL, FORK 0 pthread_create(&t938, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t939; [L878] FCALL, FORK 0 pthread_create(&t939, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 b$w_buff1 = b$w_buff0 [L757] 1 b$w_buff0 = 1 [L758] 1 b$w_buff1_used = b$w_buff0_used [L759] 1 b$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L761] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L762] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L763] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L764] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L765] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L766] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L806] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L879] 0 pthread_t t940; [L880] FCALL, FORK 0 pthread_create(&t940, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L826] 4 z = 1 [L829] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L832] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 b$flush_delayed = weak$$choice2 [L838] 4 b$mem_tmp = b [L839] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L839] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L840] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L840] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L841] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L841] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L842] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L842] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L843] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L844] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L845] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L845] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = b [L847] EXPR 4 b$flush_delayed ? b$mem_tmp : b [L847] 4 b = b$flush_delayed ? b$mem_tmp : b [L848] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1] [L772] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L772] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L773] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L773] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L774] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L774] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L775] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L775] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L776] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L776] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L812] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L812] EXPR 3 b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b [L812] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L812] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L813] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L813] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L814] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L814] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L815] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L815] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L816] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L816] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L792] EXPR 2 b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L792] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L793] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L794] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L795] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L796] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L851] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L851] EXPR 4 b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b [L851] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L851] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L852] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L852] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L853] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L853] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L854] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L854] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L855] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L855] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1] [L886] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L886] EXPR 0 b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b [L886] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L886] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L887] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L887] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L888] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L888] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L889] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L889] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L890] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L890] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 120 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 8653.7ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1916.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5145.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 101 SDtfs, 85 SDslu, 129 SDs, 0 SdLazy, 277 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 315.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 348.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=631occurred in iteration=10, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 45.4ms SsaConstructionTime, 553.7ms SatisfiabilityAnalysisTime, 690.2ms InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 175 ConstructedInterpolants, 0 QuantifiedInterpolants, 1411 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...