/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/mix053_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 20:13:39,292 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 20:13:39,294 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 20:13:39,325 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 20:13:39,325 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 20:13:39,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 20:13:39,330 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 20:13:39,336 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 20:13:39,338 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 20:13:39,340 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 20:13:39,341 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 20:13:39,342 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 20:13:39,342 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 20:13:39,346 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 20:13:39,347 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 20:13:39,349 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 20:13:39,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 20:13:39,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 20:13:39,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 20:13:39,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 20:13:39,362 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 20:13:39,363 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 20:13:39,364 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 20:13:39,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 20:13:39,372 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 20:13:39,372 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 20:13:39,372 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 20:13:39,374 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 20:13:39,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 20:13:39,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 20:13:39,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 20:13:39,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 20:13:39,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 20:13:39,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 20:13:39,378 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 20:13:39,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 20:13:39,380 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 20:13:39,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 20:13:39,380 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 20:13:39,381 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 20:13:39,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 20:13:39,385 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:13:39,425 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 20:13:39,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 20:13:39,429 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 20:13:39,429 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 20:13:39,429 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 20:13:39,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 20:13:39,430 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 20:13:39,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 20:13:39,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 20:13:39,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 20:13:39,431 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 20:13:39,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 20:13:39,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 20:13:39,432 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 20:13:39,432 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 20:13:39,432 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 20:13:39,432 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 20:13:39,432 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 20:13:39,432 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 20:13:39,433 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 20:13:39,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 20:13:39,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:13:39,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 20:13:39,433 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 20:13:39,434 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 20:13:39,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 20:13:39,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 20:13:39,434 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 20:13:39,434 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:13:39,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 20:13:39,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 20:13:39,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 20:13:39,773 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 20:13:39,774 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 20:13:39,774 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_pso.oepc.i [2021-03-11 20:13:39,828 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23a8debcb/e651883935394324a85369ff6224c04b/FLAGe7285e22f [2021-03-11 20:13:40,225 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 20:13:40,226 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_pso.oepc.i [2021-03-11 20:13:40,240 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23a8debcb/e651883935394324a85369ff6224c04b/FLAGe7285e22f [2021-03-11 20:13:40,594 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23a8debcb/e651883935394324a85369ff6224c04b [2021-03-11 20:13:40,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 20:13:40,600 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 20:13:40,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 20:13:40,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 20:13:40,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 20:13:40,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:13:40" (1/1) ... [2021-03-11 20:13:40,608 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@700303d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:40, skipping insertion in model container [2021-03-11 20:13:40,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:13:40" (1/1) ... [2021-03-11 20:13:40,614 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 20:13:40,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 20:13:40,798 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/mix053_pso.oepc.i[949,962] [2021-03-11 20:13:41,032 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:13:41,040 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 20:13:41,051 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/mix053_pso.oepc.i[949,962] [2021-03-11 20:13:41,118 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:13:41,192 INFO L208 MainTranslator]: Completed translation [2021-03-11 20:13:41,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:41 WrapperNode [2021-03-11 20:13:41,193 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 20:13:41,194 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 20:13:41,194 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 20:13:41,195 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 20:13:41,200 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:13:41" (1/1) ... [2021-03-11 20:13:41,232 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:13:41" (1/1) ... [2021-03-11 20:13:41,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 20:13:41,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 20:13:41,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 20:13:41,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 20:13:41,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:41" (1/1) ... [2021-03-11 20:13:41,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:41" (1/1) ... [2021-03-11 20:13:41,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:41" (1/1) ... [2021-03-11 20:13:41,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:41" (1/1) ... [2021-03-11 20:13:41,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:41" (1/1) ... [2021-03-11 20:13:41,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:41" (1/1) ... [2021-03-11 20:13:41,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:41" (1/1) ... [2021-03-11 20:13:41,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 20:13:41,316 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 20:13:41,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 20:13:41,316 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 20:13:41,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:41" (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:13:41,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 20:13:41,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 20:13:41,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 20:13:41,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 20:13:41,366 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 20:13:41,367 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 20:13:41,367 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 20:13:41,367 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 20:13:41,368 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 20:13:41,368 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 20:13:41,368 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-11 20:13:41,369 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-11 20:13:41,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 20:13:41,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 20:13:41,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 20:13:41,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 20:13:41,371 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:13:43,061 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 20:13:43,061 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 20:13:43,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:13:43 BoogieIcfgContainer [2021-03-11 20:13:43,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 20:13:43,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 20:13:43,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 20:13:43,068 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 20:13:43,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 08:13:40" (1/3) ... [2021-03-11 20:13:43,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be35edf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:13:43, skipping insertion in model container [2021-03-11 20:13:43,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:13:41" (2/3) ... [2021-03-11 20:13:43,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2be35edf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:13:43, skipping insertion in model container [2021-03-11 20:13:43,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:13:43" (3/3) ... [2021-03-11 20:13:43,071 INFO L111 eAbstractionObserver]: Analyzing ICFG mix053_pso.oepc.i [2021-03-11 20:13:43,078 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 20:13:43,082 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 20:13:43,083 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 20:13:43,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,124 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,124 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,124 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,125 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,125 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,125 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,125 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,125 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,126 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,126 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,131 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,131 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,131 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,131 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,132 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,134 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,134 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,135 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,135 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,135 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,136 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,136 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,137 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,137 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,137 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,137 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,139 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,139 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,139 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,139 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,140 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,140 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,141 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,141 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,141 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,141 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,142 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,143 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,146 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,152 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,152 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,153 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,153 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,153 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,153 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,153 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,153 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,153 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,153 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,153 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,154 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,154 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,154 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,154 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,154 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,154 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,154 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,154 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,154 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,154 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,155 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,155 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,155 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,155 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,155 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,155 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,155 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,155 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,161 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,161 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,162 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,162 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,162 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,162 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,162 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,162 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,162 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,162 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,162 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,162 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,164 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,164 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,164 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,164 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,164 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,165 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,165 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,165 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,165 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,165 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,165 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,165 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,165 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,165 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,165 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,166 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,166 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,166 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,166 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,166 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,171 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,173 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,174 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,174 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,175 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,176 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,177 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,178 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,178 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,178 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,179 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,179 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,179 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,179 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,180 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,180 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,180 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,180 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,181 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,182 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,185 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,194 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,195 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:13:43,200 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 20:13:43,212 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-11 20:13:43,226 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 20:13:43,226 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 20:13:43,226 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 20:13:43,226 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 20:13:43,227 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 20:13:43,227 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 20:13:43,227 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 20:13:43,227 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 20:13:43,236 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 250 flow [2021-03-11 20:13:43,272 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-03-11 20:13:43,272 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:13:43,276 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 86 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-11 20:13:43,276 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 115 transitions, 250 flow [2021-03-11 20:13:43,280 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 111 transitions, 234 flow [2021-03-11 20:13:43,283 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 20:13:43,290 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 111 transitions, 234 flow [2021-03-11 20:13:43,292 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 111 transitions, 234 flow [2021-03-11 20:13:43,292 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 234 flow [2021-03-11 20:13:43,312 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-03-11 20:13:43,312 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:13:43,313 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 86 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-11 20:13:43,315 INFO L116 LiptonReduction]: Number of co-enabled transitions 2672 [2021-03-11 20:13:44,101 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-11 20:13:44,517 WARN L205 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-11 20:13:44,639 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-11 20:13:48,192 WARN L205 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-11 20:13:48,347 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-11 20:13:48,654 WARN L205 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-11 20:13:48,795 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-11 20:13:48,803 INFO L131 LiptonReduction]: Checked pairs total: 7058 [2021-03-11 20:13:48,803 INFO L133 LiptonReduction]: Total number of compositions: 93 [2021-03-11 20:13:48,804 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5524 [2021-03-11 20:13:48,811 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2021-03-11 20:13:48,811 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:13:48,811 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:48,812 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-03-11 20:13:48,812 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:48,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:48,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1205359, now seen corresponding path program 1 times [2021-03-11 20:13:48,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:48,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20455037] [2021-03-11 20:13:48,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:13:49,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:49,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:49,036 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:13:49,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20455037] [2021-03-11 20:13:49,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:13:49,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:13:49,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821049444] [2021-03-11 20:13:49,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:13:49,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:13:49,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:13:49,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:13:49,057 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 208 [2021-03-11 20:13:49,059 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 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:13:49,059 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:13:49,059 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 208 [2021-03-11 20:13:49,060 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:13:49,172 INFO L129 PetriNetUnfolder]: 133/301 cut-off events. [2021-03-11 20:13:49,172 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:13:49,174 INFO L84 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 301 events. 133/301 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1539 event pairs, 110 based on Foata normal form. 0/275 useless extension candidates. Maximal degree in co-relation 509. Up to 153 conditions per place. [2021-03-11 20:13:49,177 INFO L132 encePairwiseOnDemand]: 205/208 looper letters, 11 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2021-03-11 20:13:49,178 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 33 transitions, 104 flow [2021-03-11 20:13:49,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:13:49,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:13:49,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 554 transitions. [2021-03-11 20:13:49,194 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8878205128205128 [2021-03-11 20:13:49,194 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 554 transitions. [2021-03-11 20:13:49,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 554 transitions. [2021-03-11 20:13:49,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:13:49,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 554 transitions. [2021-03-11 20:13:49,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 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:13:49,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 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:13:49,211 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 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:13:49,212 INFO L185 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states and 554 transitions. [2021-03-11 20:13:49,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 33 transitions, 104 flow [2021-03-11 20:13:49,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 100 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-11 20:13:49,215 INFO L241 Difference]: Finished difference. Result has 39 places, 28 transitions, 68 flow [2021-03-11 20:13:49,217 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2021-03-11 20:13:49,217 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2021-03-11 20:13:49,218 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2021-03-11 20:13:49,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 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:13:49,218 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:49,218 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:13:49,219 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 20:13:49,219 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:49,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:49,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1792414243, now seen corresponding path program 1 times [2021-03-11 20:13:49,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:49,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246106823] [2021-03-11 20:13:49,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:13:49,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:49,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:49,342 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:13:49,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246106823] [2021-03-11 20:13:49,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:13:49,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:13:49,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469307972] [2021-03-11 20:13:49,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:13:49,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:13:49,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:13:49,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:13:49,346 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 208 [2021-03-11 20:13:49,346 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 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:13:49,347 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:13:49,347 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 208 [2021-03-11 20:13:49,347 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:13:49,360 INFO L129 PetriNetUnfolder]: 7/50 cut-off events. [2021-03-11 20:13:49,360 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:13:49,360 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 50 events. 7/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 118 event pairs, 2 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 72. Up to 17 conditions per place. [2021-03-11 20:13:49,360 INFO L132 encePairwiseOnDemand]: 204/208 looper letters, 3 selfloop transitions, 3 changer transitions 2/31 dead transitions. [2021-03-11 20:13:49,360 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 31 transitions, 90 flow [2021-03-11 20:13:49,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:13:49,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:13:49,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 558 transitions. [2021-03-11 20:13:49,362 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8942307692307693 [2021-03-11 20:13:49,362 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 558 transitions. [2021-03-11 20:13:49,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 558 transitions. [2021-03-11 20:13:49,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:13:49,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 558 transitions. [2021-03-11 20:13:49,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 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:13:49,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 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:13:49,366 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 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:13:49,366 INFO L185 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 3 states and 558 transitions. [2021-03-11 20:13:49,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 31 transitions, 90 flow [2021-03-11 20:13:49,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:13:49,367 INFO L241 Difference]: Finished difference. Result has 40 places, 29 transitions, 81 flow [2021-03-11 20:13:49,367 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2021-03-11 20:13:49,368 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2021-03-11 20:13:49,368 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 81 flow [2021-03-11 20:13:49,368 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:13:49,368 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:49,368 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:13:49,368 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 20:13:49,368 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:49,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:49,369 INFO L82 PathProgramCache]: Analyzing trace with hash -269733597, now seen corresponding path program 1 times [2021-03-11 20:13:49,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:49,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966708952] [2021-03-11 20:13:49,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:13:49,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:49,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:49,447 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:13:49,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966708952] [2021-03-11 20:13:49,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:13:49,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:13:49,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768757781] [2021-03-11 20:13:49,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:13:49,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:13:49,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:13:49,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:13:49,451 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 208 [2021-03-11 20:13:49,452 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 81 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:13:49,452 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:13:49,452 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 208 [2021-03-11 20:13:49,452 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:13:49,468 INFO L129 PetriNetUnfolder]: 10/61 cut-off events. [2021-03-11 20:13:49,468 INFO L130 PetriNetUnfolder]: For 8/17 co-relation queries the response was YES. [2021-03-11 20:13:49,469 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 61 events. 10/61 cut-off events. For 8/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 192 event pairs, 3 based on Foata normal form. 1/56 useless extension candidates. Maximal degree in co-relation 100. Up to 19 conditions per place. [2021-03-11 20:13:49,471 INFO L132 encePairwiseOnDemand]: 204/208 looper letters, 3 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2021-03-11 20:13:49,473 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 31 transitions, 97 flow [2021-03-11 20:13:49,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:13:49,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:13:49,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions. [2021-03-11 20:13:49,475 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8910256410256411 [2021-03-11 20:13:49,475 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 556 transitions. [2021-03-11 20:13:49,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 556 transitions. [2021-03-11 20:13:49,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:13:49,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 556 transitions. [2021-03-11 20:13:49,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 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:13:49,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 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:13:49,478 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 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:13:49,479 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 81 flow. Second operand 3 states and 556 transitions. [2021-03-11 20:13:49,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 31 transitions, 97 flow [2021-03-11 20:13:49,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 31 transitions, 94 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 20:13:49,480 INFO L241 Difference]: Finished difference. Result has 41 places, 31 transitions, 97 flow [2021-03-11 20:13:49,480 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2021-03-11 20:13:49,480 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, -1 predicate places. [2021-03-11 20:13:49,480 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 97 flow [2021-03-11 20:13:49,481 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:13:49,481 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:49,481 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:13:49,481 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 20:13:49,481 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:49,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:49,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1387051994, now seen corresponding path program 1 times [2021-03-11 20:13:49,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:49,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734472061] [2021-03-11 20:13:49,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:13:49,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:49,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:13:49,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:49,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:49,577 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:13:49,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734472061] [2021-03-11 20:13:49,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:13:49,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:13:49,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191169631] [2021-03-11 20:13:49,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:13:49,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:13:49,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:13:49,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:13:49,581 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 208 [2021-03-11 20:13:49,582 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 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:13:49,582 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:13:49,582 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 208 [2021-03-11 20:13:49,582 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:13:49,603 INFO L129 PetriNetUnfolder]: 4/59 cut-off events. [2021-03-11 20:13:49,603 INFO L130 PetriNetUnfolder]: For 31/84 co-relation queries the response was YES. [2021-03-11 20:13:49,604 INFO L84 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 59 events. 4/59 cut-off events. For 31/84 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 208 event pairs, 1 based on Foata normal form. 4/59 useless extension candidates. Maximal degree in co-relation 105. Up to 15 conditions per place. [2021-03-11 20:13:49,605 INFO L132 encePairwiseOnDemand]: 205/208 looper letters, 3 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2021-03-11 20:13:49,605 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 31 transitions, 109 flow [2021-03-11 20:13:49,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:13:49,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:13:49,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2021-03-11 20:13:49,607 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8894230769230769 [2021-03-11 20:13:49,607 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 555 transitions. [2021-03-11 20:13:49,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 555 transitions. [2021-03-11 20:13:49,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:13:49,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 555 transitions. [2021-03-11 20:13:49,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 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:13:49,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 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:13:49,611 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 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:13:49,611 INFO L185 Difference]: Start difference. First operand has 41 places, 31 transitions, 97 flow. Second operand 3 states and 555 transitions. [2021-03-11 20:13:49,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 31 transitions, 109 flow [2021-03-11 20:13:49,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 31 transitions, 106 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 20:13:49,613 INFO L241 Difference]: Finished difference. Result has 43 places, 31 transitions, 105 flow [2021-03-11 20:13:49,613 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2021-03-11 20:13:49,613 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2021-03-11 20:13:49,614 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 105 flow [2021-03-11 20:13:49,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 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:13:49,614 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:49,614 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:13:49,614 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 20:13:49,614 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:49,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:49,615 INFO L82 PathProgramCache]: Analyzing trace with hash 228199530, now seen corresponding path program 1 times [2021-03-11 20:13:49,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:49,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297586567] [2021-03-11 20:13:49,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:13:49,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:49,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:49,722 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 20:13:49,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:13:49,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:49,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:13:49,730 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:13:49,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297586567] [2021-03-11 20:13:49,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:13:49,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:13:49,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299137893] [2021-03-11 20:13:49,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:13:49,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:13:49,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:13:49,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:13:49,734 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 208 [2021-03-11 20:13:49,735 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 105 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:13:49,735 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:13:49,735 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 208 [2021-03-11 20:13:49,735 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:13:49,821 INFO L129 PetriNetUnfolder]: 253/504 cut-off events. [2021-03-11 20:13:49,821 INFO L130 PetriNetUnfolder]: For 210/286 co-relation queries the response was YES. [2021-03-11 20:13:49,823 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1088 conditions, 504 events. 253/504 cut-off events. For 210/286 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 3017 event pairs, 125 based on Foata normal form. 38/477 useless extension candidates. Maximal degree in co-relation 1075. Up to 315 conditions per place. [2021-03-11 20:13:49,825 INFO L132 encePairwiseOnDemand]: 201/208 looper letters, 9 selfloop transitions, 9 changer transitions 2/44 dead transitions. [2021-03-11 20:13:49,825 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 171 flow [2021-03-11 20:13:49,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:13:49,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:13:49,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 872 transitions. [2021-03-11 20:13:49,827 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8384615384615385 [2021-03-11 20:13:49,827 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 872 transitions. [2021-03-11 20:13:49,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 872 transitions. [2021-03-11 20:13:49,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:13:49,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 872 transitions. [2021-03-11 20:13:49,830 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:13:49,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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:13:49,832 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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:13:49,833 INFO L185 Difference]: Start difference. First operand has 43 places, 31 transitions, 105 flow. Second operand 5 states and 872 transitions. [2021-03-11 20:13:49,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 171 flow [2021-03-11 20:13:49,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 44 transitions, 166 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-11 20:13:49,836 INFO L241 Difference]: Finished difference. Result has 49 places, 39 transitions, 169 flow [2021-03-11 20:13:49,836 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2021-03-11 20:13:49,836 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2021-03-11 20:13:49,837 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 169 flow [2021-03-11 20:13:49,837 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:13:49,837 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:49,837 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:13:49,837 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 20:13:49,837 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:49,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:49,838 INFO L82 PathProgramCache]: Analyzing trace with hash -989506632, now seen corresponding path program 1 times [2021-03-11 20:13:49,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:49,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113016960] [2021-03-11 20:13:49,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:13:49,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:49,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:13:49,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:49,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:49,922 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:13:49,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113016960] [2021-03-11 20:13:49,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:13:49,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:13:49,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472324281] [2021-03-11 20:13:49,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:13:49,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:13:49,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:13:49,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:13:49,925 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 208 [2021-03-11 20:13:49,926 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 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:13:49,926 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:13:49,926 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 208 [2021-03-11 20:13:49,926 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:13:50,003 INFO L129 PetriNetUnfolder]: 359/692 cut-off events. [2021-03-11 20:13:50,003 INFO L130 PetriNetUnfolder]: For 818/974 co-relation queries the response was YES. [2021-03-11 20:13:50,005 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2019 conditions, 692 events. 359/692 cut-off events. For 818/974 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 4463 event pairs, 194 based on Foata normal form. 23/632 useless extension candidates. Maximal degree in co-relation 2002. Up to 527 conditions per place. [2021-03-11 20:13:50,008 INFO L132 encePairwiseOnDemand]: 205/208 looper letters, 3 selfloop transitions, 3 changer transitions 4/39 dead transitions. [2021-03-11 20:13:50,008 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 39 transitions, 181 flow [2021-03-11 20:13:50,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:13:50,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:13:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2021-03-11 20:13:50,010 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8894230769230769 [2021-03-11 20:13:50,010 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 555 transitions. [2021-03-11 20:13:50,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 555 transitions. [2021-03-11 20:13:50,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:13:50,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 555 transitions. [2021-03-11 20:13:50,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 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:13:50,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 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:13:50,013 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 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:13:50,014 INFO L185 Difference]: Start difference. First operand has 49 places, 39 transitions, 169 flow. Second operand 3 states and 555 transitions. [2021-03-11 20:13:50,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 39 transitions, 181 flow [2021-03-11 20:13:50,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 39 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 20:13:50,018 INFO L241 Difference]: Finished difference. Result has 51 places, 35 transitions, 151 flow [2021-03-11 20:13:50,019 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=151, PETRI_PLACES=51, PETRI_TRANSITIONS=35} [2021-03-11 20:13:50,019 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places. [2021-03-11 20:13:50,019 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 35 transitions, 151 flow [2021-03-11 20:13:50,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 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:13:50,019 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:50,019 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:13:50,019 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 20:13:50,020 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:50,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:50,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1696800564, now seen corresponding path program 1 times [2021-03-11 20:13:50,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:50,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523338237] [2021-03-11 20:13:50,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:13:50,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:50,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:50,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:50,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:50,089 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 20:13:50,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:13:50,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:50,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:13:50,096 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:13:50,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523338237] [2021-03-11 20:13:50,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:13:50,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:13:50,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290209613] [2021-03-11 20:13:50,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:13:50,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:13:50,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:13:50,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:13:50,099 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 208 [2021-03-11 20:13:50,100 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 35 transitions, 151 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:13:50,100 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:13:50,100 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 208 [2021-03-11 20:13:50,100 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:13:50,200 INFO L129 PetriNetUnfolder]: 265/535 cut-off events. [2021-03-11 20:13:50,200 INFO L130 PetriNetUnfolder]: For 564/700 co-relation queries the response was YES. [2021-03-11 20:13:50,201 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1995 conditions, 535 events. 265/535 cut-off events. For 564/700 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 3092 event pairs, 59 based on Foata normal form. 68/548 useless extension candidates. Maximal degree in co-relation 1977. Up to 420 conditions per place. [2021-03-11 20:13:50,203 INFO L132 encePairwiseOnDemand]: 201/208 looper letters, 6 selfloop transitions, 9 changer transitions 9/48 dead transitions. [2021-03-11 20:13:50,203 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 48 transitions, 275 flow [2021-03-11 20:13:50,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:13:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:13:50,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1046 transitions. [2021-03-11 20:13:50,206 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8381410256410257 [2021-03-11 20:13:50,206 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1046 transitions. [2021-03-11 20:13:50,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1046 transitions. [2021-03-11 20:13:50,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:13:50,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1046 transitions. [2021-03-11 20:13:50,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 174.33333333333334) internal successors, (1046), 6 states have internal predecessors, (1046), 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:13:50,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 208.0) internal successors, (1456), 7 states have internal predecessors, (1456), 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:13:50,211 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 208.0) internal successors, (1456), 7 states have internal predecessors, (1456), 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:13:50,211 INFO L185 Difference]: Start difference. First operand has 51 places, 35 transitions, 151 flow. Second operand 6 states and 1046 transitions. [2021-03-11 20:13:50,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 48 transitions, 275 flow [2021-03-11 20:13:50,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 48 transitions, 268 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-11 20:13:50,215 INFO L241 Difference]: Finished difference. Result has 55 places, 39 transitions, 216 flow [2021-03-11 20:13:50,215 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=216, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2021-03-11 20:13:50,215 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2021-03-11 20:13:50,215 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 216 flow [2021-03-11 20:13:50,216 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:13:50,216 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:50,216 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:13:50,216 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 20:13:50,216 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:50,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:50,217 INFO L82 PathProgramCache]: Analyzing trace with hash 554971114, now seen corresponding path program 1 times [2021-03-11 20:13:50,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:50,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849617573] [2021-03-11 20:13:50,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:13:50,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:50,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:50,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:50,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:50,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:50,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:50,304 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 20:13:50,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:13:50,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:50,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:13:50,312 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:13:50,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849617573] [2021-03-11 20:13:50,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:13:50,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:13:50,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097229984] [2021-03-11 20:13:50,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:13:50,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:13:50,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:13:50,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:13:50,316 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 208 [2021-03-11 20:13:50,317 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 39 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 170.83333333333334) internal successors, (1025), 6 states have internal predecessors, (1025), 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:13:50,317 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:13:50,317 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 208 [2021-03-11 20:13:50,317 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:13:50,413 INFO L129 PetriNetUnfolder]: 141/321 cut-off events. [2021-03-11 20:13:50,413 INFO L130 PetriNetUnfolder]: For 794/987 co-relation queries the response was YES. [2021-03-11 20:13:50,414 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1648 conditions, 321 events. 141/321 cut-off events. For 794/987 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1631 event pairs, 8 based on Foata normal form. 73/365 useless extension candidates. Maximal degree in co-relation 1627. Up to 256 conditions per place. [2021-03-11 20:13:50,415 INFO L132 encePairwiseOnDemand]: 201/208 looper letters, 6 selfloop transitions, 13 changer transitions 9/52 dead transitions. [2021-03-11 20:13:50,415 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 52 transitions, 398 flow [2021-03-11 20:13:50,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:13:50,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:13:50,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1220 transitions. [2021-03-11 20:13:50,419 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8379120879120879 [2021-03-11 20:13:50,419 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1220 transitions. [2021-03-11 20:13:50,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1220 transitions. [2021-03-11 20:13:50,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:13:50,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1220 transitions. [2021-03-11 20:13:50,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 174.28571428571428) internal successors, (1220), 7 states have internal predecessors, (1220), 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:13:50,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 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:13:50,424 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 208.0) internal successors, (1664), 8 states have internal predecessors, (1664), 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:13:50,424 INFO L185 Difference]: Start difference. First operand has 55 places, 39 transitions, 216 flow. Second operand 7 states and 1220 transitions. [2021-03-11 20:13:50,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 52 transitions, 398 flow [2021-03-11 20:13:50,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 52 transitions, 336 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-11 20:13:50,430 INFO L241 Difference]: Finished difference. Result has 58 places, 43 transitions, 266 flow [2021-03-11 20:13:50,430 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=266, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2021-03-11 20:13:50,430 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2021-03-11 20:13:50,430 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 266 flow [2021-03-11 20:13:50,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 170.83333333333334) internal successors, (1025), 6 states have internal predecessors, (1025), 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:13:50,432 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:50,432 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] [2021-03-11 20:13:50,432 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 20:13:50,433 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:50,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:50,433 INFO L82 PathProgramCache]: Analyzing trace with hash 998203153, now seen corresponding path program 1 times [2021-03-11 20:13:50,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:50,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381630663] [2021-03-11 20:13:50,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:13:50,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:50,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:50,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:50,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:50,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:50,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:50,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:50,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:50,553 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 20:13:50,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 20:13:50,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:50,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:13:50,562 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:13:50,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381630663] [2021-03-11 20:13:50,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:13:50,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 20:13:50,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621763567] [2021-03-11 20:13:50,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 20:13:50,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:13:50,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 20:13:50,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-11 20:13:50,564 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 208 [2021-03-11 20:13:50,565 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 266 flow. Second operand has 7 states, 7 states have (on average 170.85714285714286) internal successors, (1196), 7 states have internal predecessors, (1196), 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:13:50,565 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:13:50,565 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 208 [2021-03-11 20:13:50,566 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:13:50,646 INFO L129 PetriNetUnfolder]: 77/192 cut-off events. [2021-03-11 20:13:50,647 INFO L130 PetriNetUnfolder]: For 538/722 co-relation queries the response was YES. [2021-03-11 20:13:50,647 INFO L84 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 192 events. 77/192 cut-off events. For 538/722 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 824 event pairs, 0 based on Foata normal form. 55/224 useless extension candidates. Maximal degree in co-relation 959. Up to 143 conditions per place. [2021-03-11 20:13:50,648 INFO L132 encePairwiseOnDemand]: 201/208 looper letters, 2 selfloop transitions, 17 changer transitions 7/48 dead transitions. [2021-03-11 20:13:50,648 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 48 transitions, 370 flow [2021-03-11 20:13:50,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 20:13:50,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-11 20:13:50,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1386 transitions. [2021-03-11 20:13:50,652 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8329326923076923 [2021-03-11 20:13:50,652 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1386 transitions. [2021-03-11 20:13:50,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1386 transitions. [2021-03-11 20:13:50,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:13:50,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1386 transitions. [2021-03-11 20:13:50,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 173.25) internal successors, (1386), 8 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:13:50,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 208.0) internal successors, (1872), 9 states have internal predecessors, (1872), 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:13:50,658 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 208.0) internal successors, (1872), 9 states have internal predecessors, (1872), 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:13:50,658 INFO L185 Difference]: Start difference. First operand has 58 places, 43 transitions, 266 flow. Second operand 8 states and 1386 transitions. [2021-03-11 20:13:50,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 48 transitions, 370 flow [2021-03-11 20:13:50,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 48 transitions, 304 flow, removed 24 selfloop flow, removed 5 redundant places. [2021-03-11 20:13:50,663 INFO L241 Difference]: Finished difference. Result has 61 places, 41 transitions, 246 flow [2021-03-11 20:13:50,664 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=246, PETRI_PLACES=61, PETRI_TRANSITIONS=41} [2021-03-11 20:13:50,664 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 19 predicate places. [2021-03-11 20:13:50,664 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 41 transitions, 246 flow [2021-03-11 20:13:50,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 170.85714285714286) internal successors, (1196), 7 states have internal predecessors, (1196), 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:13:50,665 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:50,665 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] [2021-03-11 20:13:50,665 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 20:13:50,665 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:50,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:50,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1469916436, now seen corresponding path program 1 times [2021-03-11 20:13:50,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:50,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294946698] [2021-03-11 20:13:50,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:13:50,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:50,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:13:50,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:13:50,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:13:50,782 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-11 20:13:50,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 20:13:50,792 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:13:50,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294946698] [2021-03-11 20:13:50,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:13:50,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:13:50,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737054937] [2021-03-11 20:13:50,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:13:50,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:13:50,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:13:50,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:13:50,795 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 208 [2021-03-11 20:13:50,796 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 41 transitions, 246 flow. Second operand has 4 states, 4 states have (on average 167.25) internal successors, (669), 4 states have internal predecessors, (669), 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:13:50,796 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:13:50,796 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 208 [2021-03-11 20:13:50,796 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:13:50,884 INFO L129 PetriNetUnfolder]: 169/412 cut-off events. [2021-03-11 20:13:50,885 INFO L130 PetriNetUnfolder]: For 631/685 co-relation queries the response was YES. [2021-03-11 20:13:50,887 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1360 conditions, 412 events. 169/412 cut-off events. For 631/685 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2338 event pairs, 0 based on Foata normal form. 2/393 useless extension candidates. Maximal degree in co-relation 1337. Up to 133 conditions per place. [2021-03-11 20:13:50,888 INFO L132 encePairwiseOnDemand]: 199/208 looper letters, 8 selfloop transitions, 13 changer transitions 9/60 dead transitions. [2021-03-11 20:13:50,888 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 384 flow [2021-03-11 20:13:50,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:13:50,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:13:50,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 851 transitions. [2021-03-11 20:13:50,890 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8182692307692307 [2021-03-11 20:13:50,890 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 851 transitions. [2021-03-11 20:13:50,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 851 transitions. [2021-03-11 20:13:50,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:13:50,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 851 transitions. [2021-03-11 20:13:50,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 170.2) internal successors, (851), 5 states have internal predecessors, (851), 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:13:50,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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:13:50,895 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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:13:50,896 INFO L185 Difference]: Start difference. First operand has 61 places, 41 transitions, 246 flow. Second operand 5 states and 851 transitions. [2021-03-11 20:13:50,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 384 flow [2021-03-11 20:13:50,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 300 flow, removed 20 selfloop flow, removed 10 redundant places. [2021-03-11 20:13:50,902 INFO L241 Difference]: Finished difference. Result has 57 places, 50 transitions, 273 flow [2021-03-11 20:13:50,902 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=273, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2021-03-11 20:13:50,903 INFO L335 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2021-03-11 20:13:50,903 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 273 flow [2021-03-11 20:13:50,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 167.25) internal successors, (669), 4 states have internal predecessors, (669), 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:13:50,903 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:13:50,903 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] [2021-03-11 20:13:50,903 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 20:13:50,903 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:13:50,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:13:50,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1238915318, now seen corresponding path program 2 times [2021-03-11 20:13:50,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:13:50,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47225380] [2021-03-11 20:13:50,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:13:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:13:51,007 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:13:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:13:51,080 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:13:51,122 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 20:13:51,122 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 20:13:51,123 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 20:13:51,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 08:13:51 BasicIcfg [2021-03-11 20:13:51,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 20:13:51,248 INFO L168 Benchmark]: Toolchain (without parser) took 10650.78 ms. Allocated memory was 255.9 MB in the beginning and 555.7 MB in the end (delta: 299.9 MB). Free memory was 234.1 MB in the beginning and 481.6 MB in the end (delta: -247.5 MB). Peak memory consumption was 52.2 MB. Max. memory is 16.0 GB. [2021-03-11 20:13:51,248 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 255.9 MB. Free memory is still 237.3 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 20:13:51,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 591.88 ms. Allocated memory was 255.9 MB in the beginning and 346.0 MB in the end (delta: 90.2 MB). Free memory was 233.9 MB in the beginning and 304.0 MB in the end (delta: -70.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. [2021-03-11 20:13:51,252 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.12 ms. Allocated memory is still 346.0 MB. Free memory was 304.0 MB in the beginning and 301.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-11 20:13:51,252 INFO L168 Benchmark]: Boogie Preprocessor took 46.86 ms. Allocated memory is still 346.0 MB. Free memory was 301.4 MB in the beginning and 298.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:13:51,253 INFO L168 Benchmark]: RCFGBuilder took 1747.09 ms. Allocated memory was 346.0 MB in the beginning and 415.2 MB in the end (delta: 69.2 MB). Free memory was 298.9 MB in the beginning and 364.1 MB in the end (delta: -65.2 MB). Peak memory consumption was 66.6 MB. Max. memory is 16.0 GB. [2021-03-11 20:13:51,253 INFO L168 Benchmark]: TraceAbstraction took 8181.95 ms. Allocated memory was 415.2 MB in the beginning and 555.7 MB in the end (delta: 140.5 MB). Free memory was 364.1 MB in the beginning and 481.6 MB in the end (delta: -117.4 MB). Peak memory consumption was 22.0 MB. Max. memory is 16.0 GB. [2021-03-11 20:13:51,258 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.10 ms. Allocated memory is still 255.9 MB. Free memory is still 237.3 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 591.88 ms. Allocated memory was 255.9 MB in the beginning and 346.0 MB in the end (delta: 90.2 MB). Free memory was 233.9 MB in the beginning and 304.0 MB in the end (delta: -70.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 74.12 ms. Allocated memory is still 346.0 MB. Free memory was 304.0 MB in the beginning and 301.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 46.86 ms. Allocated memory is still 346.0 MB. Free memory was 301.4 MB in the beginning and 298.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1747.09 ms. Allocated memory was 346.0 MB in the beginning and 415.2 MB in the end (delta: 69.2 MB). Free memory was 298.9 MB in the beginning and 364.1 MB in the end (delta: -65.2 MB). Peak memory consumption was 66.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 8181.95 ms. Allocated memory was 415.2 MB in the beginning and 555.7 MB in the end (delta: 140.5 MB). Free memory was 364.1 MB in the beginning and 481.6 MB in the end (delta: -117.4 MB). Peak memory consumption was 22.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5511.4ms, 122 PlacesBefore, 42 PlacesAfterwards, 111 TransitionsBefore, 29 TransitionsAfterwards, 2672 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 93 TotalNumberOfCompositions, 7058 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2990, positive: 2799, positive conditional: 0, positive unconditional: 2799, negative: 191, negative conditional: 0, negative unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1822, positive: 1756, positive conditional: 0, positive unconditional: 1756, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1822, positive: 1740, positive conditional: 0, positive unconditional: 1740, negative: 82, negative conditional: 0, negative unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 82, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 766, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 722, negative conditional: 0, negative unconditional: 722, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2990, positive: 1043, positive conditional: 0, positive unconditional: 1043, negative: 125, negative conditional: 0, negative unconditional: 125, unknown: 1822, unknown conditional: 0, unknown unconditional: 1822] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 162, Positive conditional cache size: 0, Positive unconditional cache size: 162, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - 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_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L859] 0 pthread_t t1417; [L860] FCALL, FORK 0 pthread_create(&t1417, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1418; [L862] FCALL, FORK 0 pthread_create(&t1418, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L863] 0 pthread_t t1419; [L864] FCALL, FORK 0 pthread_create(&t1419, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L798] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L865] 0 pthread_t t1420; [L866] FCALL, FORK 0 pthread_create(&t1420, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L801] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L818] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 a$flush_delayed = weak$$choice2 [L824] 4 a$mem_tmp = a [L825] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L825] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L826] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L826] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L826] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L826] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L827] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L827] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L827] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L827] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L828] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L828] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L828] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L828] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L829] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L829] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L829] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L830] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L830] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L830] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L831] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L831] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L831] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L831] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = a [L833] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L833] 4 a = a$flush_delayed ? a$mem_tmp : a [L834] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L764] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L804] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L804] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L804] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L837] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L837] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L837] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L837] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L838] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L839] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L840] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L841] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L872] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L872] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L872] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L872] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L873] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L874] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L875] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L875] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L876] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L879] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 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: 7900.0ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 898.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5582.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 53 SDtfs, 27 SDslu, 18 SDs, 0 SdLazy, 195 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 169.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 121.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=273occurred in iteration=10, InterpolantAutomatonStates: 46, 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: 58.2ms SsaConstructionTime, 506.0ms SatisfiabilityAnalysisTime, 532.3ms InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 469 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...