/usr/bin/java -Xmx8000000000 -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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9bbddad6b14272d9691b7fb6f1c011d15ab18596-9bbddad [2021-06-13 07:12:35,099 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-13 07:12:35,101 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-13 07:12:35,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-13 07:12:35,125 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-13 07:12:35,126 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-13 07:12:35,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-13 07:12:35,129 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-13 07:12:35,131 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-13 07:12:35,131 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-13 07:12:35,132 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-13 07:12:35,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-13 07:12:35,133 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-13 07:12:35,134 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-13 07:12:35,135 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-13 07:12:35,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-13 07:12:35,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-13 07:12:35,138 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-13 07:12:35,139 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-13 07:12:35,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-13 07:12:35,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-13 07:12:35,158 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-13 07:12:35,160 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-13 07:12:35,160 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-13 07:12:35,163 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-13 07:12:35,163 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-13 07:12:35,163 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-13 07:12:35,164 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-13 07:12:35,165 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-13 07:12:35,165 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-13 07:12:35,166 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-13 07:12:35,166 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-13 07:12:35,169 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-13 07:12:35,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-13 07:12:35,171 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-13 07:12:35,171 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-13 07:12:35,172 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-13 07:12:35,172 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-13 07:12:35,172 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-13 07:12:35,173 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-13 07:12:35,173 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-13 07:12:35,179 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-NoLbe.epf [2021-06-13 07:12:35,207 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-13 07:12:35,207 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-13 07:12:35,209 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-13 07:12:35,210 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-13 07:12:35,210 INFO L138 SettingsManager]: * Use SBE=true [2021-06-13 07:12:35,210 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-13 07:12:35,210 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-13 07:12:35,210 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-13 07:12:35,210 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-13 07:12:35,210 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-13 07:12:35,211 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-13 07:12:35,211 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-13 07:12:35,211 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-13 07:12:35,212 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-13 07:12:35,212 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-13 07:12:35,212 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-13 07:12:35,212 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-13 07:12:35,212 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-13 07:12:35,212 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-13 07:12:35,212 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-13 07:12:35,213 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-13 07:12:35,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-13 07:12:35,213 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-13 07:12:35,213 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-13 07:12:35,213 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-13 07:12:35,213 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-13 07:12:35,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-13 07:12:35,214 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-13 07:12:35,214 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-13 07:12:35,214 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-06-13 07:12:35,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-13 07:12:35,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-13 07:12:35,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-13 07:12:35,534 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-13 07:12:35,534 INFO L275 PluginConnector]: CDTParser initialized [2021-06-13 07:12:35,535 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_rmo.opt.i [2021-06-13 07:12:35,603 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb69cf0ce/26f85e7b8ea64811aa722c00839bc502/FLAG21be3dccd [2021-06-13 07:12:36,152 INFO L306 CDTParser]: Found 1 translation units. [2021-06-13 07:12:36,152 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_rmo.opt.i [2021-06-13 07:12:36,168 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb69cf0ce/26f85e7b8ea64811aa722c00839bc502/FLAG21be3dccd [2021-06-13 07:12:36,596 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb69cf0ce/26f85e7b8ea64811aa722c00839bc502 [2021-06-13 07:12:36,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-13 07:12:36,599 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-13 07:12:36,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-13 07:12:36,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-13 07:12:36,607 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-13 07:12:36,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.06 07:12:36" (1/1) ... [2021-06-13 07:12:36,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@427528fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:12:36, skipping insertion in model container [2021-06-13 07:12:36,609 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.06 07:12:36" (1/1) ... [2021-06-13 07:12:36,616 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-13 07:12:36,664 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-13 07:12:36,833 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_rmo.opt.i[991,1004] [2021-06-13 07:12:37,078 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-13 07:12:37,086 INFO L203 MainTranslator]: Completed pre-run [2021-06-13 07:12:37,098 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_rmo.opt.i[991,1004] [2021-06-13 07:12:37,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-13 07:12:37,238 INFO L208 MainTranslator]: Completed translation [2021-06-13 07:12:37,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:12:37 WrapperNode [2021-06-13 07:12:37,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-13 07:12:37,241 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-13 07:12:37,241 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-13 07:12:37,241 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-13 07:12:37,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:12:37" (1/1) ... [2021-06-13 07:12:37,282 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:12:37" (1/1) ... [2021-06-13 07:12:37,313 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-13 07:12:37,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-13 07:12:37,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-13 07:12:37,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-13 07:12:37,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:12:37" (1/1) ... [2021-06-13 07:12:37,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:12:37" (1/1) ... [2021-06-13 07:12:37,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:12:37" (1/1) ... [2021-06-13 07:12:37,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:12:37" (1/1) ... [2021-06-13 07:12:37,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:12:37" (1/1) ... [2021-06-13 07:12:37,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:12:37" (1/1) ... [2021-06-13 07:12:37,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:12:37" (1/1) ... [2021-06-13 07:12:37,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-13 07:12:37,370 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-13 07:12:37,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-13 07:12:37,370 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-13 07:12:37,371 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:12:37" (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-06-13 07:12:37,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-13 07:12:37,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-13 07:12:37,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-13 07:12:37,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-13 07:12:37,430 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-13 07:12:37,430 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-13 07:12:37,430 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-13 07:12:37,430 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-13 07:12:37,430 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-13 07:12:37,430 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-13 07:12:37,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-13 07:12:37,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-13 07:12:37,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-13 07:12:37,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-13 07:12:37,432 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-13 07:12:39,083 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-13 07:12:39,084 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-13 07:12:39,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.06 07:12:39 BoogieIcfgContainer [2021-06-13 07:12:39,086 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-13 07:12:39,087 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-13 07:12:39,087 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-13 07:12:39,090 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-13 07:12:39,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.06 07:12:36" (1/3) ... [2021-06-13 07:12:39,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56369400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.06 07:12:39, skipping insertion in model container [2021-06-13 07:12:39,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.06 07:12:37" (2/3) ... [2021-06-13 07:12:39,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56369400 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.06 07:12:39, skipping insertion in model container [2021-06-13 07:12:39,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.06 07:12:39" (3/3) ... [2021-06-13 07:12:39,092 INFO L111 eAbstractionObserver]: Analyzing ICFG mix025_rmo.opt.i [2021-06-13 07:12:39,098 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-13 07:12:39,098 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-13 07:12:39,099 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-13 07:12:39,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,132 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,132 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,133 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,133 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,140 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,140 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,141 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,141 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,141 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,141 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,141 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,141 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,141 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,141 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,148 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,149 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,149 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,149 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,149 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,150 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,150 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,150 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,151 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,154 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,154 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,155 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,155 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,158 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,159 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,160 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,160 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,161 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,161 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,163 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,164 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,165 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,166 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,168 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,168 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,168 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,169 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,169 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,169 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,169 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,169 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-13 07:12:39,170 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-13 07:12:39,189 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-13 07:12:39,206 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-13 07:12:39,206 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-13 07:12:39,206 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-13 07:12:39,206 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-13 07:12:39,206 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-13 07:12:39,207 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-13 07:12:39,207 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-13 07:12:39,207 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1======== [2021-06-13 07:12:39,217 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2021-06-13 07:12:39,247 INFO L129 PetriNetUnfolder]: 2/105 cut-off events. [2021-06-13 07:12:39,247 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:12:39,251 INFO L84 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2021-06-13 07:12:39,251 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2021-06-13 07:12:39,253 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 0 places, 0 transitions, 0 flow [2021-06-13 07:12:39,253 INFO L129 PetriNetUnfolder]: 0/0 cut-off events. [2021-06-13 07:12:39,253 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:12:39,254 INFO L301 ceAbstractionStarter]: Result for error location P1 was SAFE (1/3) [2021-06-13 07:12:39,256 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-13 07:12:39,258 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-13 07:12:39,258 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-13 07:12:39,258 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-13 07:12:39,258 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-13 07:12:39,258 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-13 07:12:39,259 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-13 07:12:39,259 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-13 07:12:39,259 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1Thread1of1ForFork2======== [2021-06-13 07:12:39,261 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2021-06-13 07:12:39,281 INFO L129 PetriNetUnfolder]: 2/105 cut-off events. [2021-06-13 07:12:39,281 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:12:39,282 INFO L84 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2021-06-13 07:12:39,282 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2021-06-13 07:12:39,285 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2021-06-13 07:12:39,294 INFO L129 PetriNetUnfolder]: 0/57 cut-off events. [2021-06-13 07:12:39,294 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:12:39,295 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:12:39,295 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-13 07:12:39,296 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:12:39,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:12:39,300 INFO L82 PathProgramCache]: Analyzing trace with hash 619546369, now seen corresponding path program 1 times [2021-06-13 07:12:39,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:12:39,307 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459490023] [2021-06-13 07:12:39,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:12:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:12:39,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:39,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:12:39,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:39,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:12:39,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:12:39,559 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:12:39,560 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459490023] [2021-06-13 07:12:39,560 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459490023] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:12:39,561 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:12:39,561 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-13 07:12:39,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966438863] [2021-06-13 07:12:39,568 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-13 07:12:39,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:12:39,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-13 07:12:39,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-13 07:12:39,579 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 108 [2021-06-13 07:12:39,582 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 105 transitions, 219 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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-06-13 07:12:39,582 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:12:39,582 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 108 [2021-06-13 07:12:39,583 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:12:39,681 INFO L129 PetriNetUnfolder]: 29/226 cut-off events. [2021-06-13 07:12:39,681 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:12:39,684 INFO L84 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 226 events. 29/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 739 event pairs, 15 based on Foata normal form. 12/223 useless extension candidates. Maximal degree in co-relation 241. Up to 41 conditions per place. [2021-06-13 07:12:39,685 INFO L132 encePairwiseOnDemand]: 103/108 looper letters, 0 selfloop transitions, 0 changer transitions 104/104 dead transitions. [2021-06-13 07:12:39,685 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 104 transitions, 235 flow [2021-06-13 07:12:39,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-13 07:12:39,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-13 07:12:39,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2021-06-13 07:12:39,700 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9506172839506173 [2021-06-13 07:12:39,701 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 308 transitions. [2021-06-13 07:12:39,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 308 transitions. [2021-06-13 07:12:39,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:12:39,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 308 transitions. [2021-06-13 07:12:39,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-06-13 07:12:39,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 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-06-13 07:12:39,725 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 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-06-13 07:12:39,726 INFO L185 Difference]: Start difference. First operand has 113 places, 105 transitions, 219 flow. Second operand 3 states and 308 transitions. [2021-06-13 07:12:39,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 104 transitions, 235 flow [2021-06-13 07:12:39,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 104 transitions, 232 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-13 07:12:39,732 INFO L241 Difference]: Finished difference. Result has 110 places, 0 transitions, 0 flow [2021-06-13 07:12:39,733 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=110, PETRI_TRANSITIONS=0} [2021-06-13 07:12:39,734 INFO L335 CegarLoopForPetriNet]: 113 programPoint places, -3 predicate places. [2021-06-13 07:12:39,734 INFO L482 AbstractCegarLoop]: Abstraction has has 110 places, 0 transitions, 0 flow [2021-06-13 07:12:39,734 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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-06-13 07:12:39,734 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-13 07:12:39,735 INFO L301 ceAbstractionStarter]: Result for error location P1Thread1of1ForFork2 was SAFE (2/3) [2021-06-13 07:12:39,736 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-13 07:12:39,739 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-13 07:12:39,740 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-13 07:12:39,740 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-13 07:12:39,740 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-13 07:12:39,740 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-13 07:12:39,740 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-13 07:12:39,740 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-13 07:12:39,740 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-13 07:12:39,746 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2021-06-13 07:12:39,759 INFO L129 PetriNetUnfolder]: 2/105 cut-off events. [2021-06-13 07:12:39,759 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:12:39,759 INFO L84 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2021-06-13 07:12:39,759 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2021-06-13 07:12:39,760 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 93 transitions, 195 flow [2021-06-13 07:12:39,768 INFO L129 PetriNetUnfolder]: 1/92 cut-off events. [2021-06-13 07:12:39,769 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:12:39,769 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:12:39,769 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-13 07:12:39,769 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:12:39,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:12:39,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1045967373, now seen corresponding path program 1 times [2021-06-13 07:12:39,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:12:39,770 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019868084] [2021-06-13 07:12:39,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:12:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:12:39,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:39,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:12:39,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:39,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:12:39,883 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-06-13 07:12:39,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-13 07:12:39,895 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:12:39,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:12:39,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:39,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:12:39,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:39,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:12:39,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:39,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:12:39,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:12:39,929 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:12:39,929 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019868084] [2021-06-13 07:12:39,929 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019868084] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:12:39,929 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:12:39,929 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-13 07:12:39,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594125704] [2021-06-13 07:12:39,930 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-13 07:12:39,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:12:39,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-13 07:12:39,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-13 07:12:39,932 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 108 [2021-06-13 07:12:39,933 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 93 transitions, 195 flow. Second operand has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 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-06-13 07:12:39,933 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:12:39,933 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 108 [2021-06-13 07:12:39,933 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:12:40,247 INFO L129 PetriNetUnfolder]: 209/659 cut-off events. [2021-06-13 07:12:40,248 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-13 07:12:40,250 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 659 events. 209/659 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3880 event pairs, 25 based on Foata normal form. 28/668 useless extension candidates. Maximal degree in co-relation 990. Up to 118 conditions per place. [2021-06-13 07:12:40,252 INFO L132 encePairwiseOnDemand]: 98/108 looper letters, 18 selfloop transitions, 5 changer transitions 38/138 dead transitions. [2021-06-13 07:12:40,253 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 138 transitions, 407 flow [2021-06-13 07:12:40,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-13 07:12:40,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-06-13 07:12:40,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1224 transitions. [2021-06-13 07:12:40,257 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8717948717948718 [2021-06-13 07:12:40,257 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1224 transitions. [2021-06-13 07:12:40,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1224 transitions. [2021-06-13 07:12:40,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:12:40,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1224 transitions. [2021-06-13 07:12:40,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 94.15384615384616) internal successors, (1224), 13 states have internal predecessors, (1224), 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-06-13 07:12:40,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 108.0) internal successors, (1512), 14 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:12:40,264 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 108.0) internal successors, (1512), 14 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:12:40,265 INFO L185 Difference]: Start difference. First operand has 102 places, 93 transitions, 195 flow. Second operand 13 states and 1224 transitions. [2021-06-13 07:12:40,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 138 transitions, 407 flow [2021-06-13 07:12:40,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 138 transitions, 404 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-13 07:12:40,269 INFO L241 Difference]: Finished difference. Result has 123 places, 95 transitions, 262 flow [2021-06-13 07:12:40,269 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=262, PETRI_PLACES=123, PETRI_TRANSITIONS=95} [2021-06-13 07:12:40,269 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, 21 predicate places. [2021-06-13 07:12:40,269 INFO L482 AbstractCegarLoop]: Abstraction has has 123 places, 95 transitions, 262 flow [2021-06-13 07:12:40,270 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 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-06-13 07:12:40,270 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:12:40,270 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-13 07:12:40,270 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-13 07:12:40,270 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:12:40,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:12:40,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1223706700, now seen corresponding path program 1 times [2021-06-13 07:12:40,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:12:40,271 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239729322] [2021-06-13 07:12:40,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:12:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:12:40,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:40,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:12:40,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:40,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:12:40,338 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-13 07:12:40,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-13 07:12:40,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:40,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-13 07:12:40,359 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-13 07:12:40,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:12:40,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:40,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:12:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:12:40,367 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:12:40,368 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239729322] [2021-06-13 07:12:40,368 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239729322] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:12:40,368 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:12:40,368 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-13 07:12:40,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892651621] [2021-06-13 07:12:40,369 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-13 07:12:40,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:12:40,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-13 07:12:40,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-13 07:12:40,371 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 108 [2021-06-13 07:12:40,372 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 95 transitions, 262 flow. Second operand has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 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-06-13 07:12:40,372 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:12:40,372 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 108 [2021-06-13 07:12:40,372 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:12:40,616 INFO L129 PetriNetUnfolder]: 391/1020 cut-off events. [2021-06-13 07:12:40,616 INFO L130 PetriNetUnfolder]: For 510/532 co-relation queries the response was YES. [2021-06-13 07:12:40,621 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2115 conditions, 1020 events. 391/1020 cut-off events. For 510/532 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 7569 event pairs, 46 based on Foata normal form. 10/936 useless extension candidates. Maximal degree in co-relation 2054. Up to 259 conditions per place. [2021-06-13 07:12:40,626 INFO L132 encePairwiseOnDemand]: 98/108 looper letters, 24 selfloop transitions, 17 changer transitions 0/125 dead transitions. [2021-06-13 07:12:40,627 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 125 transitions, 404 flow [2021-06-13 07:12:40,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-13 07:12:40,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-06-13 07:12:40,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 983 transitions. [2021-06-13 07:12:40,630 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9101851851851852 [2021-06-13 07:12:40,630 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 983 transitions. [2021-06-13 07:12:40,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 983 transitions. [2021-06-13 07:12:40,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:12:40,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 983 transitions. [2021-06-13 07:12:40,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.3) internal successors, (983), 10 states have internal predecessors, (983), 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-06-13 07:12:40,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 108.0) internal successors, (1188), 11 states have internal predecessors, (1188), 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-06-13 07:12:40,637 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 108.0) internal successors, (1188), 11 states have internal predecessors, (1188), 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-06-13 07:12:40,637 INFO L185 Difference]: Start difference. First operand has 123 places, 95 transitions, 262 flow. Second operand 10 states and 983 transitions. [2021-06-13 07:12:40,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 125 transitions, 404 flow [2021-06-13 07:12:40,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 125 transitions, 390 flow, removed 6 selfloop flow, removed 4 redundant places. [2021-06-13 07:12:40,646 INFO L241 Difference]: Finished difference. Result has 125 places, 110 transitions, 368 flow [2021-06-13 07:12:40,646 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=368, PETRI_PLACES=125, PETRI_TRANSITIONS=110} [2021-06-13 07:12:40,647 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, 23 predicate places. [2021-06-13 07:12:40,647 INFO L482 AbstractCegarLoop]: Abstraction has has 125 places, 110 transitions, 368 flow [2021-06-13 07:12:40,647 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 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-06-13 07:12:40,647 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:12:40,648 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-13 07:12:40,648 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-13 07:12:40,648 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:12:40,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:12:40,649 INFO L82 PathProgramCache]: Analyzing trace with hash -2026488944, now seen corresponding path program 1 times [2021-06-13 07:12:40,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:12:40,649 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504274281] [2021-06-13 07:12:40,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:12:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:12:40,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:40,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:12:40,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:40,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:12:40,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:40,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:12:40,769 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-13 07:12:40,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-13 07:12:40,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:40,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-13 07:12:40,793 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-13 07:12:40,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:12:40,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:40,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:12:40,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:12:40,803 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:12:40,803 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504274281] [2021-06-13 07:12:40,803 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504274281] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:12:40,803 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:12:40,803 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-13 07:12:40,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978651247] [2021-06-13 07:12:40,804 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-13 07:12:40,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:12:40,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-13 07:12:40,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-13 07:12:40,806 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 108 [2021-06-13 07:12:40,806 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 110 transitions, 368 flow. Second operand has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 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-06-13 07:12:40,806 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:12:40,807 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 108 [2021-06-13 07:12:40,807 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:12:41,157 INFO L129 PetriNetUnfolder]: 346/975 cut-off events. [2021-06-13 07:12:41,157 INFO L130 PetriNetUnfolder]: For 2117/2628 co-relation queries the response was YES. [2021-06-13 07:12:41,162 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3205 conditions, 975 events. 346/975 cut-off events. For 2117/2628 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 7446 event pairs, 10 based on Foata normal form. 140/1051 useless extension candidates. Maximal degree in co-relation 3139. Up to 359 conditions per place. [2021-06-13 07:12:41,167 INFO L132 encePairwiseOnDemand]: 98/108 looper letters, 20 selfloop transitions, 32 changer transitions 9/145 dead transitions. [2021-06-13 07:12:41,167 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 145 transitions, 714 flow [2021-06-13 07:12:41,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-13 07:12:41,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-06-13 07:12:41,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1279 transitions. [2021-06-13 07:12:41,170 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9109686609686609 [2021-06-13 07:12:41,171 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1279 transitions. [2021-06-13 07:12:41,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1279 transitions. [2021-06-13 07:12:41,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:12:41,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1279 transitions. [2021-06-13 07:12:41,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 98.38461538461539) internal successors, (1279), 13 states have internal predecessors, (1279), 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-06-13 07:12:41,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 108.0) internal successors, (1512), 14 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:12:41,177 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 108.0) internal successors, (1512), 14 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:12:41,177 INFO L185 Difference]: Start difference. First operand has 125 places, 110 transitions, 368 flow. Second operand 13 states and 1279 transitions. [2021-06-13 07:12:41,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 145 transitions, 714 flow [2021-06-13 07:12:41,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 145 transitions, 706 flow, removed 3 selfloop flow, removed 4 redundant places. [2021-06-13 07:12:41,185 INFO L241 Difference]: Finished difference. Result has 137 places, 130 transitions, 603 flow [2021-06-13 07:12:41,185 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=603, PETRI_PLACES=137, PETRI_TRANSITIONS=130} [2021-06-13 07:12:41,185 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, 35 predicate places. [2021-06-13 07:12:41,186 INFO L482 AbstractCegarLoop]: Abstraction has has 137 places, 130 transitions, 603 flow [2021-06-13 07:12:41,186 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 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-06-13 07:12:41,186 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:12:41,186 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-13 07:12:41,186 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-13 07:12:41,186 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:12:41,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:12:41,187 INFO L82 PathProgramCache]: Analyzing trace with hash 743872466, now seen corresponding path program 1 times [2021-06-13 07:12:41,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:12:41,187 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062807828] [2021-06-13 07:12:41,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:12:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:12:41,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:41,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:12:41,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:41,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:12:41,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:41,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:12:41,299 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-06-13 07:12:41,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-13 07:12:41,311 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:12:41,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:12:41,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:41,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:12:41,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:41,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:12:41,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:41,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:12:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:12:41,353 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:12:41,353 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062807828] [2021-06-13 07:12:41,354 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062807828] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:12:41,354 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:12:41,354 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-13 07:12:41,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219705823] [2021-06-13 07:12:41,354 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-13 07:12:41,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:12:41,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-13 07:12:41,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-06-13 07:12:41,356 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 108 [2021-06-13 07:12:41,357 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 130 transitions, 603 flow. Second operand has 8 states, 8 states have (on average 89.0) internal successors, (712), 8 states have internal predecessors, (712), 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-06-13 07:12:41,357 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:12:41,357 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 108 [2021-06-13 07:12:41,357 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:12:41,717 INFO L129 PetriNetUnfolder]: 375/1538 cut-off events. [2021-06-13 07:12:41,717 INFO L130 PetriNetUnfolder]: For 4089/4410 co-relation queries the response was YES. [2021-06-13 07:12:41,725 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4864 conditions, 1538 events. 375/1538 cut-off events. For 4089/4410 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 14340 event pairs, 1 based on Foata normal form. 11/1476 useless extension candidates. Maximal degree in co-relation 4791. Up to 407 conditions per place. [2021-06-13 07:12:41,731 INFO L132 encePairwiseOnDemand]: 95/108 looper letters, 31 selfloop transitions, 18 changer transitions 10/169 dead transitions. [2021-06-13 07:12:41,731 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 169 transitions, 920 flow [2021-06-13 07:12:41,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-13 07:12:41,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-13 07:12:41,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 839 transitions. [2021-06-13 07:12:41,734 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8631687242798354 [2021-06-13 07:12:41,734 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 839 transitions. [2021-06-13 07:12:41,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 839 transitions. [2021-06-13 07:12:41,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:12:41,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 839 transitions. [2021-06-13 07:12:41,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 93.22222222222223) internal successors, (839), 9 states have internal predecessors, (839), 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-06-13 07:12:41,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 108.0) internal successors, (1080), 10 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:12:41,738 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 108.0) internal successors, (1080), 10 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:12:41,738 INFO L185 Difference]: Start difference. First operand has 137 places, 130 transitions, 603 flow. Second operand 9 states and 839 transitions. [2021-06-13 07:12:41,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 169 transitions, 920 flow [2021-06-13 07:12:41,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 169 transitions, 806 flow, removed 44 selfloop flow, removed 6 redundant places. [2021-06-13 07:12:41,786 INFO L241 Difference]: Finished difference. Result has 147 places, 143 transitions, 655 flow [2021-06-13 07:12:41,786 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=655, PETRI_PLACES=147, PETRI_TRANSITIONS=143} [2021-06-13 07:12:41,786 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, 45 predicate places. [2021-06-13 07:12:41,787 INFO L482 AbstractCegarLoop]: Abstraction has has 147 places, 143 transitions, 655 flow [2021-06-13 07:12:41,787 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 89.0) internal successors, (712), 8 states have internal predecessors, (712), 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-06-13 07:12:41,787 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:12:41,787 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-13 07:12:41,787 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-13 07:12:41,787 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:12:41,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:12:41,788 INFO L82 PathProgramCache]: Analyzing trace with hash 547164690, now seen corresponding path program 2 times [2021-06-13 07:12:41,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:12:41,789 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192828389] [2021-06-13 07:12:41,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:12:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:12:41,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:41,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:12:41,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:41,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:12:41,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:41,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:12:41,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:41,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:12:41,923 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-13 07:12:41,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-13 07:12:41,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:41,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-13 07:12:41,950 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-13 07:12:41,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:12:41,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:41,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:12:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:12:41,962 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:12:41,962 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192828389] [2021-06-13 07:12:41,962 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192828389] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:12:41,962 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:12:41,963 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-13 07:12:41,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691404339] [2021-06-13 07:12:41,963 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-13 07:12:41,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:12:41,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-13 07:12:41,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-13 07:12:41,965 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 108 [2021-06-13 07:12:41,966 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 143 transitions, 655 flow. Second operand has 8 states, 8 states have (on average 95.125) internal successors, (761), 8 states have internal predecessors, (761), 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-06-13 07:12:41,966 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:12:41,966 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 108 [2021-06-13 07:12:41,966 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:12:42,430 INFO L129 PetriNetUnfolder]: 520/1627 cut-off events. [2021-06-13 07:12:42,431 INFO L130 PetriNetUnfolder]: For 2630/3981 co-relation queries the response was YES. [2021-06-13 07:12:42,442 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4949 conditions, 1627 events. 520/1627 cut-off events. For 2630/3981 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 15344 event pairs, 0 based on Foata normal form. 312/1790 useless extension candidates. Maximal degree in co-relation 4921. Up to 254 conditions per place. [2021-06-13 07:12:42,448 INFO L132 encePairwiseOnDemand]: 98/108 looper letters, 16 selfloop transitions, 36 changer transitions 20/169 dead transitions. [2021-06-13 07:12:42,448 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 169 transitions, 941 flow [2021-06-13 07:12:42,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-13 07:12:42,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-06-13 07:12:42,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1560 transitions. [2021-06-13 07:12:42,452 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9027777777777778 [2021-06-13 07:12:42,452 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1560 transitions. [2021-06-13 07:12:42,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1560 transitions. [2021-06-13 07:12:42,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:12:42,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1560 transitions. [2021-06-13 07:12:42,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 97.5) internal successors, (1560), 16 states have internal predecessors, (1560), 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-06-13 07:12:42,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 108.0) internal successors, (1836), 17 states have internal predecessors, (1836), 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-06-13 07:12:42,460 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 108.0) internal successors, (1836), 17 states have internal predecessors, (1836), 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-06-13 07:12:42,460 INFO L185 Difference]: Start difference. First operand has 147 places, 143 transitions, 655 flow. Second operand 16 states and 1560 transitions. [2021-06-13 07:12:42,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 169 transitions, 941 flow [2021-06-13 07:12:42,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 169 transitions, 917 flow, removed 10 selfloop flow, removed 4 redundant places. [2021-06-13 07:12:42,479 INFO L241 Difference]: Finished difference. Result has 162 places, 143 transitions, 749 flow [2021-06-13 07:12:42,479 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=749, PETRI_PLACES=162, PETRI_TRANSITIONS=143} [2021-06-13 07:12:42,479 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, 60 predicate places. [2021-06-13 07:12:42,479 INFO L482 AbstractCegarLoop]: Abstraction has has 162 places, 143 transitions, 749 flow [2021-06-13 07:12:42,480 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 95.125) internal successors, (761), 8 states have internal predecessors, (761), 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-06-13 07:12:42,480 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:12:42,480 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-13 07:12:42,480 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-13 07:12:42,480 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:12:42,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:12:42,481 INFO L82 PathProgramCache]: Analyzing trace with hash -521429640, now seen corresponding path program 1 times [2021-06-13 07:12:42,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:12:42,481 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066802627] [2021-06-13 07:12:42,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:12:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-13 07:12:42,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:42,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:12:42,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:42,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-13 07:12:42,577 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-13 07:12:42,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-13 07:12:42,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:42,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:12:42,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:42,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-13 07:12:42,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-13 07:12:42,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-13 07:12:42,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-13 07:12:42,609 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-13 07:12:42,609 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066802627] [2021-06-13 07:12:42,610 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066802627] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-13 07:12:42,610 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-13 07:12:42,610 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-13 07:12:42,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989694540] [2021-06-13 07:12:42,610 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-13 07:12:42,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-13 07:12:42,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-13 07:12:42,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-13 07:12:42,612 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 108 [2021-06-13 07:12:42,612 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 143 transitions, 749 flow. Second operand has 6 states, 6 states have (on average 95.66666666666667) internal successors, (574), 6 states have internal predecessors, (574), 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-06-13 07:12:42,612 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-13 07:12:42,612 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 108 [2021-06-13 07:12:42,613 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-13 07:12:42,849 INFO L129 PetriNetUnfolder]: 387/1618 cut-off events. [2021-06-13 07:12:42,850 INFO L130 PetriNetUnfolder]: For 3564/3738 co-relation queries the response was YES. [2021-06-13 07:12:42,861 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4896 conditions, 1618 events. 387/1618 cut-off events. For 3564/3738 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 16392 event pairs, 0 based on Foata normal form. 1/1521 useless extension candidates. Maximal degree in co-relation 4811. Up to 204 conditions per place. [2021-06-13 07:12:42,863 INFO L132 encePairwiseOnDemand]: 102/108 looper letters, 8 selfloop transitions, 2 changer transitions 55/151 dead transitions. [2021-06-13 07:12:42,863 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 151 transitions, 839 flow [2021-06-13 07:12:42,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-13 07:12:42,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-13 07:12:42,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 581 transitions. [2021-06-13 07:12:42,865 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8966049382716049 [2021-06-13 07:12:42,865 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 581 transitions. [2021-06-13 07:12:42,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 581 transitions. [2021-06-13 07:12:42,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-13 07:12:42,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 581 transitions. [2021-06-13 07:12:42,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 96.83333333333333) internal successors, (581), 6 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-13 07:12:42,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 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-06-13 07:12:42,869 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 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-06-13 07:12:42,869 INFO L185 Difference]: Start difference. First operand has 162 places, 143 transitions, 749 flow. Second operand 6 states and 581 transitions. [2021-06-13 07:12:42,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 151 transitions, 839 flow [2021-06-13 07:12:42,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 151 transitions, 764 flow, removed 13 selfloop flow, removed 14 redundant places. [2021-06-13 07:12:42,915 INFO L241 Difference]: Finished difference. Result has 154 places, 96 transitions, 336 flow [2021-06-13 07:12:42,916 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=108, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=336, PETRI_PLACES=154, PETRI_TRANSITIONS=96} [2021-06-13 07:12:42,916 INFO L335 CegarLoopForPetriNet]: 102 programPoint places, 52 predicate places. [2021-06-13 07:12:42,916 INFO L482 AbstractCegarLoop]: Abstraction has has 154 places, 96 transitions, 336 flow [2021-06-13 07:12:42,916 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 95.66666666666667) internal successors, (574), 6 states have internal predecessors, (574), 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-06-13 07:12:42,916 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-06-13 07:12:42,917 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06-13 07:12:42,917 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-13 07:12:42,917 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-13 07:12:42,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-13 07:12:42,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1114978096, now seen corresponding path program 2 times [2021-06-13 07:12:42,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-13 07:12:42,917 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281544666] [2021-06-13 07:12:42,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-13 07:12:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-13 07:12:42,957 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-13 07:12:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-13 07:12:42,995 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-13 07:12:43,028 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-13 07:12:43,029 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-13 07:12:43,029 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-13 07:12:43,029 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (3/3) [2021-06-13 07:12:43,030 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-13 07:12:43,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.06 07:12:43 BasicIcfg [2021-06-13 07:12:43,136 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-13 07:12:43,137 INFO L168 Benchmark]: Toolchain (without parser) took 6537.18 ms. Allocated memory was 183.5 MB in the beginning and 355.5 MB in the end (delta: 172.0 MB). Free memory was 145.7 MB in the beginning and 145.5 MB in the end (delta: 121.4 kB). Peak memory consumption was 172.8 MB. Max. memory is 8.0 GB. [2021-06-13 07:12:43,137 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 183.5 MB. Free memory is still 164.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-13 07:12:43,137 INFO L168 Benchmark]: CACSL2BoogieTranslator took 639.66 ms. Allocated memory is still 183.5 MB. Free memory was 145.5 MB in the beginning and 142.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-06-13 07:12:43,138 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.85 ms. Allocated memory is still 183.5 MB. Free memory was 142.2 MB in the beginning and 140.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-06-13 07:12:43,138 INFO L168 Benchmark]: Boogie Preprocessor took 55.43 ms. Allocated memory is still 183.5 MB. Free memory was 140.1 MB in the beginning and 137.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-06-13 07:12:43,138 INFO L168 Benchmark]: RCFGBuilder took 1715.62 ms. Allocated memory was 183.5 MB in the beginning and 250.6 MB in the end (delta: 67.1 MB). Free memory was 137.5 MB in the beginning and 196.9 MB in the end (delta: -59.4 MB). Peak memory consumption was 84.3 MB. Max. memory is 8.0 GB. [2021-06-13 07:12:43,139 INFO L168 Benchmark]: TraceAbstraction took 4048.52 ms. Allocated memory was 250.6 MB in the beginning and 355.5 MB in the end (delta: 104.9 MB). Free memory was 196.4 MB in the beginning and 145.5 MB in the end (delta: 50.8 MB). Peak memory consumption was 155.7 MB. Max. memory is 8.0 GB. [2021-06-13 07:12:43,141 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 183.5 MB. Free memory is still 164.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 639.66 ms. Allocated memory is still 183.5 MB. Free memory was 145.5 MB in the beginning and 142.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 72.85 ms. Allocated memory is still 183.5 MB. Free memory was 142.2 MB in the beginning and 140.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 55.43 ms. Allocated memory is still 183.5 MB. Free memory was 140.1 MB in the beginning and 137.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1715.62 ms. Allocated memory was 183.5 MB in the beginning and 250.6 MB in the end (delta: 67.1 MB). Free memory was 137.5 MB in the beginning and 196.9 MB in the end (delta: -59.4 MB). Peak memory consumption was 84.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 4048.52 ms. Allocated memory was 250.6 MB in the beginning and 355.5 MB in the end (delta: 104.9 MB). Free memory was 196.4 MB in the beginning and 145.5 MB in the end (delta: 50.8 MB). Peak memory consumption was 155.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L722] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L723] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L724] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L725] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L726] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L727] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L728] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L729] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L730] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L731] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L732] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L733] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L734] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L735] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L736] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L738] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L740] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L741] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L742] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L834] 0 pthread_t t672; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] FCALL, FORK 0 pthread_create(&t672, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L836] 0 pthread_t t673; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t673, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L838] 0 pthread_t t674; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L839] FCALL, FORK 0 pthread_create(&t674, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L806] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L809] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=0] [L746] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L812] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L812] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L813] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L814] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L815] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L815] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L816] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L816] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L4] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L845] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L845] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L846] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L846] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L847] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L847] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L848] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L848] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L849] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L849] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L852] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L19] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L19] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1 with 1 thread instances CFG has 7 procedures, 135 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: SAFE, OverallTime: 51.7ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 46.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1Thread1of1ForFork2 with 1 thread instances CFG has 7 procedures, 135 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 8.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: SAFE, OverallTime: 477.2ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 159.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 26.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 4 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=219occurred in iteration=0, InterpolantAutomatonStates: 3, 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: 6.1ms SsaConstructionTime, 43.6ms SatisfiabilityAnalysisTime, 143.4ms InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 93 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 135 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 8.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 3289.8ms, OverallIterations: 7, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2249.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 19.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 82 SDtfs, 204 SDslu, 311 SDs, 0 SdLazy, 315 SolverSat, 85 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 289.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 696.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=749occurred in iteration=5, InterpolantAutomatonStates: 67, 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: 27.7ms SsaConstructionTime, 287.6ms SatisfiabilityAnalysisTime, 565.9ms InterpolantComputationTime, 542 NumberOfCodeBlocks, 542 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 452 ConstructedInterpolants, 0 QuantifiedInterpolants, 1804 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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...