/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 20:04:30,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 20:04:30,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 20:04:30,246 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 20:04:30,247 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 20:04:30,249 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 20:04:30,251 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 20:04:30,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 20:04:30,257 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 20:04:30,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 20:04:30,261 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 20:04:30,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 20:04:30,273 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 20:04:30,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 20:04:30,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 20:04:30,276 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 20:04:30,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 20:04:30,279 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 20:04:30,281 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 20:04:30,286 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 20:04:30,287 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 20:04:30,288 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 20:04:30,289 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 20:04:30,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 20:04:30,294 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 20:04:30,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 20:04:30,295 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 20:04:30,296 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 20:04:30,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 20:04:30,296 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 20:04:30,297 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 20:04:30,297 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 20:04:30,298 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 20:04:30,299 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 20:04:30,299 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 20:04:30,299 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 20:04:30,300 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 20:04:30,300 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 20:04:30,300 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 20:04:30,300 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 20:04:30,301 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 20:04:30,301 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2021-03-11 20:04:30,332 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 20:04:30,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 20:04:30,335 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 20:04:30,335 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 20:04:30,335 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 20:04:30,335 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 20:04:30,335 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 20:04:30,335 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 20:04:30,335 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 20:04:30,336 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 20:04:30,336 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 20:04:30,336 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 20:04:30,336 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 20:04:30,337 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 20:04:30,337 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 20:04:30,337 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 20:04:30,337 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 20:04:30,337 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 20:04:30,337 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 20:04:30,337 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 20:04:30,337 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 20:04:30,337 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:04:30,338 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 20:04:30,338 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 20:04:30,338 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 20:04:30,338 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 20:04:30,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 20:04:30,338 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 20:04:30,338 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-11 20:04:30,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 20:04:30,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 20:04:30,581 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 20:04:30,582 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 20:04:30,583 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 20:04:30,583 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_tso.oepc.i [2021-03-11 20:04:30,642 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4337b02c/70bfdfd96b8749cb9b7561d8bb2ae930/FLAG8de773f2b [2021-03-11 20:04:31,083 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 20:04:31,084 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_tso.oepc.i [2021-03-11 20:04:31,094 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4337b02c/70bfdfd96b8749cb9b7561d8bb2ae930/FLAG8de773f2b [2021-03-11 20:04:31,110 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4337b02c/70bfdfd96b8749cb9b7561d8bb2ae930 [2021-03-11 20:04:31,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 20:04:31,117 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 20:04:31,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 20:04:31,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 20:04:31,122 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 20:04:31,123 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:04:31" (1/1) ... [2021-03-11 20:04:31,124 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2938672e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:04:31, skipping insertion in model container [2021-03-11 20:04:31,124 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:04:31" (1/1) ... [2021-03-11 20:04:31,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 20:04:31,173 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 20:04:31,326 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_tso.oepc.i[949,962] [2021-03-11 20:04:31,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:04:31,502 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 20:04:31,511 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_tso.oepc.i[949,962] [2021-03-11 20:04:31,560 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:04:31,614 INFO L208 MainTranslator]: Completed translation [2021-03-11 20:04:31,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:04:31 WrapperNode [2021-03-11 20:04:31,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 20:04:31,616 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 20:04:31,616 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 20:04:31,617 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 20:04:31,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:04:31" (1/1) ... [2021-03-11 20:04:31,639 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:04:31" (1/1) ... [2021-03-11 20:04:31,662 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 20:04:31,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 20:04:31,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 20:04:31,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 20:04:31,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:04:31" (1/1) ... [2021-03-11 20:04:31,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:04:31" (1/1) ... [2021-03-11 20:04:31,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:04:31" (1/1) ... [2021-03-11 20:04:31,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:04:31" (1/1) ... [2021-03-11 20:04:31,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:04:31" (1/1) ... [2021-03-11 20:04:31,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:04:31" (1/1) ... [2021-03-11 20:04:31,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:04:31" (1/1) ... [2021-03-11 20:04:31,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 20:04:31,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 20:04:31,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 20:04:31,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 20:04:31,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:04:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:04:31,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 20:04:31,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 20:04:31,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 20:04:31,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 20:04:31,757 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 20:04:31,757 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 20:04:31,757 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 20:04:31,758 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 20:04:31,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 20:04:31,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 20:04:31,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 20:04:31,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 20:04:31,759 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 20:04:33,465 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 20:04:33,465 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 20:04:33,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:04:33 BoogieIcfgContainer [2021-03-11 20:04:33,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 20:04:33,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 20:04:33,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 20:04:33,470 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 20:04:33,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 08:04:31" (1/3) ... [2021-03-11 20:04:33,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23635ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:04:33, skipping insertion in model container [2021-03-11 20:04:33,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:04:31" (2/3) ... [2021-03-11 20:04:33,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23635ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:04:33, skipping insertion in model container [2021-03-11 20:04:33,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:04:33" (3/3) ... [2021-03-11 20:04:33,471 INFO L111 eAbstractionObserver]: Analyzing ICFG mix022_tso.oepc.i [2021-03-11 20:04:33,476 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 20:04:33,484 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 20:04:33,485 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 20:04:33,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,539 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,539 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,539 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,539 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,541 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,541 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,542 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,542 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,542 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,542 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,542 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,542 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,561 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,562 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,562 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,562 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,562 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,562 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,562 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,562 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,562 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,562 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,562 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,566 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,566 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,567 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,567 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,567 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,567 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,567 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,567 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,567 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,567 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,567 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,567 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,567 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,567 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,567 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,568 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,568 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,568 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,568 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,568 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,568 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,568 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,568 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,568 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,568 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,568 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,568 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,569 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,569 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,569 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,569 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,569 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,569 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,569 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,569 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:04:33,572 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 20:04:33,586 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-11 20:04:33,603 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 20:04:33,604 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 20:04:33,604 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 20:04:33,604 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 20:04:33,604 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 20:04:33,604 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 20:04:33,604 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 20:04:33,604 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 20:04:33,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 82 transitions, 174 flow [2021-03-11 20:04:33,654 INFO L129 PetriNetUnfolder]: 2/80 cut-off events. [2021-03-11 20:04:33,654 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:04:33,656 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 80 events. 2/80 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2021-03-11 20:04:33,656 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 82 transitions, 174 flow [2021-03-11 20:04:33,659 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 80 transitions, 166 flow [2021-03-11 20:04:33,662 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 20:04:33,669 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 80 transitions, 166 flow [2021-03-11 20:04:33,672 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 80 transitions, 166 flow [2021-03-11 20:04:33,672 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 166 flow [2021-03-11 20:04:33,694 INFO L129 PetriNetUnfolder]: 2/80 cut-off events. [2021-03-11 20:04:33,695 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:04:33,695 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 80 events. 2/80 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2021-03-11 20:04:33,697 INFO L116 LiptonReduction]: Number of co-enabled transitions 982 [2021-03-11 20:04:34,614 WARN L205 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2021-03-11 20:04:34,880 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-11 20:04:36,104 WARN L205 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-03-11 20:04:36,674 WARN L205 SmtUtils]: Spent 568.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-11 20:04:37,332 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-11 20:04:37,655 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-11 20:04:37,765 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-11 20:04:38,413 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-11 20:04:38,516 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-11 20:04:39,489 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-11 20:04:39,744 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-11 20:04:40,265 WARN L205 SmtUtils]: Spent 518.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-11 20:04:40,784 WARN L205 SmtUtils]: Spent 518.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-11 20:04:41,828 WARN L205 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2021-03-11 20:04:41,940 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-11 20:04:42,193 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2021-03-11 20:04:42,309 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2021-03-11 20:04:42,311 INFO L131 LiptonReduction]: Checked pairs total: 2387 [2021-03-11 20:04:42,311 INFO L133 LiptonReduction]: Total number of compositions: 70 [2021-03-11 20:04:42,312 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8653 [2021-03-11 20:04:42,322 INFO L129 PetriNetUnfolder]: 0/6 cut-off events. [2021-03-11 20:04:42,322 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:04:42,323 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:04:42,323 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-03-11 20:04:42,323 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:04:42,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:04:42,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1191670126, now seen corresponding path program 1 times [2021-03-11 20:04:42,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:04:42,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664479958] [2021-03-11 20:04:42,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:04:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:04:42,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:04:42,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:04:42,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:04:42,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664479958] [2021-03-11 20:04:42,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:04:42,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:04:42,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009270600] [2021-03-11 20:04:42,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:04:42,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:04:42,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:04:42,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:04:42,526 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 152 [2021-03-11 20:04:42,529 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:42,529 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:04:42,529 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 152 [2021-03-11 20:04:42,530 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:04:42,588 INFO L129 PetriNetUnfolder]: 23/75 cut-off events. [2021-03-11 20:04:42,589 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:04:42,589 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 75 events. 23/75 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 283 event pairs, 10 based on Foata normal form. 8/75 useless extension candidates. Maximal degree in co-relation 121. Up to 40 conditions per place. [2021-03-11 20:04:42,591 INFO L132 encePairwiseOnDemand]: 148/152 looper letters, 8 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2021-03-11 20:04:42,591 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 21 transitions, 68 flow [2021-03-11 20:04:42,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:04:42,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:04:42,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2021-03-11 20:04:42,604 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8245614035087719 [2021-03-11 20:04:42,605 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2021-03-11 20:04:42,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2021-03-11 20:04:42,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:04:42,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2021-03-11 20:04:42,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:42,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:42,619 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:42,620 INFO L185 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 376 transitions. [2021-03-11 20:04:42,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 21 transitions, 68 flow [2021-03-11 20:04:42,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 21 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:04:42,623 INFO L241 Difference]: Finished difference. Result has 25 places, 18 transitions, 44 flow [2021-03-11 20:04:42,624 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=25, PETRI_TRANSITIONS=18} [2021-03-11 20:04:42,625 INFO L335 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2021-03-11 20:04:42,625 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 44 flow [2021-03-11 20:04:42,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:42,625 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:04:42,625 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:04:42,625 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 20:04:42,625 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:04:42,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:04:42,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1152986298, now seen corresponding path program 1 times [2021-03-11 20:04:42,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:04:42,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793771670] [2021-03-11 20:04:42,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:04:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:04:42,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:04:42,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:04:42,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:04:42,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:04:42,767 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 20:04:42,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:04:42,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:04:42,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793771670] [2021-03-11 20:04:42,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:04:42,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:04:42,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799781666] [2021-03-11 20:04:42,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:04:42,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:04:42,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:04:42,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:04:42,786 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 152 [2021-03-11 20:04:42,787 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 44 flow. Second operand has 5 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:42,787 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:04:42,787 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 152 [2021-03-11 20:04:42,787 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:04:42,899 INFO L129 PetriNetUnfolder]: 87/183 cut-off events. [2021-03-11 20:04:42,900 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2021-03-11 20:04:42,900 INFO L84 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 183 events. 87/183 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 746 event pairs, 33 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 355. Up to 98 conditions per place. [2021-03-11 20:04:42,902 INFO L132 encePairwiseOnDemand]: 146/152 looper letters, 9 selfloop transitions, 3 changer transitions 11/31 dead transitions. [2021-03-11 20:04:42,902 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 31 transitions, 122 flow [2021-03-11 20:04:42,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:04:42,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:04:42,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2021-03-11 20:04:42,905 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7105263157894737 [2021-03-11 20:04:42,905 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 540 transitions. [2021-03-11 20:04:42,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 540 transitions. [2021-03-11 20:04:42,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:04:42,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 540 transitions. [2021-03-11 20:04:42,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:42,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 152.0) internal successors, (912), 6 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:42,909 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 152.0) internal successors, (912), 6 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:42,909 INFO L185 Difference]: Start difference. First operand has 25 places, 18 transitions, 44 flow. Second operand 5 states and 540 transitions. [2021-03-11 20:04:42,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 31 transitions, 122 flow [2021-03-11 20:04:42,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 31 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:04:42,910 INFO L241 Difference]: Finished difference. Result has 30 places, 19 transitions, 65 flow [2021-03-11 20:04:42,910 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=65, PETRI_PLACES=30, PETRI_TRANSITIONS=19} [2021-03-11 20:04:42,911 INFO L335 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2021-03-11 20:04:42,911 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 65 flow [2021-03-11 20:04:42,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:42,911 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:04:42,911 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:04:42,912 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 20:04:42,912 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:04:42,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:04:42,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1382870437, now seen corresponding path program 1 times [2021-03-11 20:04:42,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:04:42,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243276012] [2021-03-11 20:04:42,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:04:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:04:42,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:04:42,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:04:42,978 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 20:04:42,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:04:42,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:04:42,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243276012] [2021-03-11 20:04:42,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:04:42,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:04:42,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624440953] [2021-03-11 20:04:42,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:04:42,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:04:42,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:04:42,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:04:42,983 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 152 [2021-03-11 20:04:42,983 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 65 flow. Second operand has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:42,983 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:04:42,983 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 152 [2021-03-11 20:04:42,983 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:04:43,008 INFO L129 PetriNetUnfolder]: 5/40 cut-off events. [2021-03-11 20:04:43,008 INFO L130 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2021-03-11 20:04:43,009 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 40 events. 5/40 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 109 event pairs, 1 based on Foata normal form. 5/44 useless extension candidates. Maximal degree in co-relation 76. Up to 14 conditions per place. [2021-03-11 20:04:43,009 INFO L132 encePairwiseOnDemand]: 148/152 looper letters, 2 selfloop transitions, 2 changer transitions 2/21 dead transitions. [2021-03-11 20:04:43,009 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 21 transitions, 83 flow [2021-03-11 20:04:43,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:04:43,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:04:43,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 623 transitions. [2021-03-11 20:04:43,011 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8197368421052632 [2021-03-11 20:04:43,011 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 623 transitions. [2021-03-11 20:04:43,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 623 transitions. [2021-03-11 20:04:43,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:04:43,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 623 transitions. [2021-03-11 20:04:43,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:43,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 152.0) internal successors, (912), 6 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:43,013 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 152.0) internal successors, (912), 6 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:43,013 INFO L185 Difference]: Start difference. First operand has 30 places, 19 transitions, 65 flow. Second operand 5 states and 623 transitions. [2021-03-11 20:04:43,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 21 transitions, 83 flow [2021-03-11 20:04:43,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 21 transitions, 76 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-11 20:04:43,014 INFO L241 Difference]: Finished difference. Result has 32 places, 19 transitions, 70 flow [2021-03-11 20:04:43,015 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=32, PETRI_TRANSITIONS=19} [2021-03-11 20:04:43,015 INFO L335 CegarLoopForPetriNet]: 26 programPoint places, 6 predicate places. [2021-03-11 20:04:43,015 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 19 transitions, 70 flow [2021-03-11 20:04:43,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:43,015 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:04:43,015 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:04:43,015 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 20:04:43,015 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:04:43,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:04:43,016 INFO L82 PathProgramCache]: Analyzing trace with hash -680485945, now seen corresponding path program 1 times [2021-03-11 20:04:43,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:04:43,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230677530] [2021-03-11 20:04:43,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:04:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:04:43,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:04:43,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:04:43,095 INFO L142 QuantifierPusher]: treesize reduction 9, result has 76.9 percent of original size [2021-03-11 20:04:43,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-11 20:04:43,114 INFO L142 QuantifierPusher]: treesize reduction 7, result has 73.1 percent of original size [2021-03-11 20:04:43,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 20:04:43,130 INFO L142 QuantifierPusher]: treesize reduction 7, result has 75.9 percent of original size [2021-03-11 20:04:43,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-11 20:04:43,148 INFO L142 QuantifierPusher]: treesize reduction 9, result has 52.6 percent of original size [2021-03-11 20:04:43,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 20:04:43,158 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 20:04:43,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:04:43,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:04:43,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230677530] [2021-03-11 20:04:43,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:04:43,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 20:04:43,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429884998] [2021-03-11 20:04:43,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 20:04:43,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:04:43,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 20:04:43,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-11 20:04:43,166 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 152 [2021-03-11 20:04:43,166 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 19 transitions, 70 flow. Second operand has 8 states, 8 states have (on average 80.875) internal successors, (647), 8 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:43,166 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:04:43,166 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 152 [2021-03-11 20:04:43,166 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:04:43,467 INFO L129 PetriNetUnfolder]: 128/249 cut-off events. [2021-03-11 20:04:43,467 INFO L130 PetriNetUnfolder]: For 213/213 co-relation queries the response was YES. [2021-03-11 20:04:43,470 INFO L84 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 249 events. 128/249 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 971 event pairs, 33 based on Foata normal form. 12/261 useless extension candidates. Maximal degree in co-relation 640. Up to 188 conditions per place. [2021-03-11 20:04:43,475 INFO L132 encePairwiseOnDemand]: 142/152 looper letters, 18 selfloop transitions, 22 changer transitions 8/53 dead transitions. [2021-03-11 20:04:43,475 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 53 transitions, 290 flow [2021-03-11 20:04:43,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 20:04:43,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 20:04:43,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 770 transitions. [2021-03-11 20:04:43,480 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.5628654970760234 [2021-03-11 20:04:43,480 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 770 transitions. [2021-03-11 20:04:43,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 770 transitions. [2021-03-11 20:04:43,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:04:43,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 770 transitions. [2021-03-11 20:04:43,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 85.55555555555556) internal successors, (770), 9 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:43,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 152.0) internal successors, (1520), 10 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:43,486 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 152.0) internal successors, (1520), 10 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:43,486 INFO L185 Difference]: Start difference. First operand has 32 places, 19 transitions, 70 flow. Second operand 9 states and 770 transitions. [2021-03-11 20:04:43,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 53 transitions, 290 flow [2021-03-11 20:04:43,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 53 transitions, 270 flow, removed 4 selfloop flow, removed 4 redundant places. [2021-03-11 20:04:43,489 INFO L241 Difference]: Finished difference. Result has 39 places, 38 transitions, 212 flow [2021-03-11 20:04:43,489 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=212, PETRI_PLACES=39, PETRI_TRANSITIONS=38} [2021-03-11 20:04:43,489 INFO L335 CegarLoopForPetriNet]: 26 programPoint places, 13 predicate places. [2021-03-11 20:04:43,489 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 38 transitions, 212 flow [2021-03-11 20:04:43,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 80.875) internal successors, (647), 8 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:43,490 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:04:43,490 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:04:43,490 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 20:04:43,490 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:04:43,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:04:43,490 INFO L82 PathProgramCache]: Analyzing trace with hash 80626055, now seen corresponding path program 2 times [2021-03-11 20:04:43,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:04:43,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404762032] [2021-03-11 20:04:43,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:04:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:04:43,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:04:43,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:04:43,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:04:43,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:04:43,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:04:43,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:04:43,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:04:43,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404762032] [2021-03-11 20:04:43,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:04:43,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:04:43,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158074942] [2021-03-11 20:04:43,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:04:43,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:04:43,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:04:43,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:04:43,586 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 152 [2021-03-11 20:04:43,587 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 38 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:43,587 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:04:43,587 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 152 [2021-03-11 20:04:43,587 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:04:43,614 INFO L129 PetriNetUnfolder]: 30/98 cut-off events. [2021-03-11 20:04:43,614 INFO L130 PetriNetUnfolder]: For 88/89 co-relation queries the response was YES. [2021-03-11 20:04:43,614 INFO L84 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 98 events. 30/98 cut-off events. For 88/89 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 354 event pairs, 5 based on Foata normal form. 10/104 useless extension candidates. Maximal degree in co-relation 276. Up to 38 conditions per place. [2021-03-11 20:04:43,615 INFO L132 encePairwiseOnDemand]: 147/152 looper letters, 4 selfloop transitions, 6 changer transitions 7/39 dead transitions. [2021-03-11 20:04:43,615 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 39 transitions, 216 flow [2021-03-11 20:04:43,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:04:43,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:04:43,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2021-03-11 20:04:43,616 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8078947368421052 [2021-03-11 20:04:43,617 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 614 transitions. [2021-03-11 20:04:43,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 614 transitions. [2021-03-11 20:04:43,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:04:43,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 614 transitions. [2021-03-11 20:04:43,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:43,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 152.0) internal successors, (912), 6 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:43,619 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 152.0) internal successors, (912), 6 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:43,619 INFO L185 Difference]: Start difference. First operand has 39 places, 38 transitions, 212 flow. Second operand 5 states and 614 transitions. [2021-03-11 20:04:43,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 39 transitions, 216 flow [2021-03-11 20:04:43,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 39 transitions, 191 flow, removed 11 selfloop flow, removed 4 redundant places. [2021-03-11 20:04:43,621 INFO L241 Difference]: Finished difference. Result has 39 places, 32 transitions, 171 flow [2021-03-11 20:04:43,621 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2021-03-11 20:04:43,621 INFO L335 CegarLoopForPetriNet]: 26 programPoint places, 13 predicate places. [2021-03-11 20:04:43,621 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 171 flow [2021-03-11 20:04:43,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:43,622 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:04:43,622 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:04:43,622 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 20:04:43,622 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:04:43,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:04:43,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1223762813, now seen corresponding path program 1 times [2021-03-11 20:04:43,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:04:43,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504057735] [2021-03-11 20:04:43,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:04:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:04:43,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:04:43,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:04:43,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:04:43,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:04:43,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:04:43,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:04:43,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:04:43,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:04:43,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:04:43,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504057735] [2021-03-11 20:04:43,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:04:43,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:04:43,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426208940] [2021-03-11 20:04:43,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:04:43,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:04:43,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:04:43,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:04:43,706 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 152 [2021-03-11 20:04:43,706 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 171 flow. Second operand has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:43,706 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:04:43,706 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 152 [2021-03-11 20:04:43,706 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:04:43,745 INFO L129 PetriNetUnfolder]: 19/77 cut-off events. [2021-03-11 20:04:43,745 INFO L130 PetriNetUnfolder]: For 113/116 co-relation queries the response was YES. [2021-03-11 20:04:43,746 INFO L84 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 77 events. 19/77 cut-off events. For 113/116 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 266 event pairs, 7 based on Foata normal form. 9/84 useless extension candidates. Maximal degree in co-relation 236. Up to 31 conditions per place. [2021-03-11 20:04:43,746 INFO L132 encePairwiseOnDemand]: 147/152 looper letters, 2 selfloop transitions, 9 changer transitions 2/35 dead transitions. [2021-03-11 20:04:43,746 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 213 flow [2021-03-11 20:04:43,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:04:43,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:04:43,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 854 transitions. [2021-03-11 20:04:43,748 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8026315789473685 [2021-03-11 20:04:43,748 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 854 transitions. [2021-03-11 20:04:43,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 854 transitions. [2021-03-11 20:04:43,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:04:43,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 854 transitions. [2021-03-11 20:04:43,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:43,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 152.0) internal successors, (1216), 8 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:43,751 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 152.0) internal successors, (1216), 8 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:43,751 INFO L185 Difference]: Start difference. First operand has 39 places, 32 transitions, 171 flow. Second operand 7 states and 854 transitions. [2021-03-11 20:04:43,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 213 flow [2021-03-11 20:04:43,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 35 transitions, 197 flow, removed 5 selfloop flow, removed 3 redundant places. [2021-03-11 20:04:43,774 INFO L241 Difference]: Finished difference. Result has 45 places, 33 transitions, 192 flow [2021-03-11 20:04:43,774 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=192, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2021-03-11 20:04:43,774 INFO L335 CegarLoopForPetriNet]: 26 programPoint places, 19 predicate places. [2021-03-11 20:04:43,774 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 192 flow [2021-03-11 20:04:43,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:43,775 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:04:43,775 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:04:43,775 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 20:04:43,775 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:04:43,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:04:43,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1314756530, now seen corresponding path program 1 times [2021-03-11 20:04:43,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:04:43,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612025963] [2021-03-11 20:04:43,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:04:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:04:43,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:04:43,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:04:43,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:04:43,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:04:43,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:04:43,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:04:43,828 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 20:04:43,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:04:43,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:04:43,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612025963] [2021-03-11 20:04:43,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:04:43,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:04:43,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699285273] [2021-03-11 20:04:43,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:04:43,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:04:43,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:04:43,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:04:43,834 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 152 [2021-03-11 20:04:43,834 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 192 flow. Second operand has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:43,834 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:04:43,834 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 152 [2021-03-11 20:04:43,834 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:04:43,878 INFO L129 PetriNetUnfolder]: 24/106 cut-off events. [2021-03-11 20:04:43,878 INFO L130 PetriNetUnfolder]: For 169/170 co-relation queries the response was YES. [2021-03-11 20:04:43,879 INFO L84 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 106 events. 24/106 cut-off events. For 169/170 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 466 event pairs, 10 based on Foata normal form. 1/107 useless extension candidates. Maximal degree in co-relation 338. Up to 41 conditions per place. [2021-03-11 20:04:43,880 INFO L132 encePairwiseOnDemand]: 148/152 looper letters, 4 selfloop transitions, 1 changer transitions 9/35 dead transitions. [2021-03-11 20:04:43,880 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 35 transitions, 210 flow [2021-03-11 20:04:43,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:04:43,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:04:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2021-03-11 20:04:43,882 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7736842105263158 [2021-03-11 20:04:43,883 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 588 transitions. [2021-03-11 20:04:43,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 588 transitions. [2021-03-11 20:04:43,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:04:43,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 588 transitions. [2021-03-11 20:04:43,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:43,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 152.0) internal successors, (912), 6 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:43,889 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 152.0) internal successors, (912), 6 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:43,889 INFO L185 Difference]: Start difference. First operand has 45 places, 33 transitions, 192 flow. Second operand 5 states and 588 transitions. [2021-03-11 20:04:43,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 35 transitions, 210 flow [2021-03-11 20:04:43,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 35 transitions, 174 flow, removed 9 selfloop flow, removed 7 redundant places. [2021-03-11 20:04:43,892 INFO L241 Difference]: Finished difference. Result has 44 places, 26 transitions, 132 flow [2021-03-11 20:04:43,892 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=44, PETRI_TRANSITIONS=26} [2021-03-11 20:04:43,892 INFO L335 CegarLoopForPetriNet]: 26 programPoint places, 18 predicate places. [2021-03-11 20:04:43,892 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 26 transitions, 132 flow [2021-03-11 20:04:43,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 20:04:43,892 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:04:43,893 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:04:43,893 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 20:04:43,893 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:04:43,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:04:43,893 INFO L82 PathProgramCache]: Analyzing trace with hash -962100070, now seen corresponding path program 2 times [2021-03-11 20:04:43,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:04:43,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952652999] [2021-03-11 20:04:43,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:04:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:04:43,954 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:04:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:04:44,018 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:04:44,055 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 20:04:44,055 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 20:04:44,055 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 20:04:44,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 08:04:44 BasicIcfg [2021-03-11 20:04:44,100 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 20:04:44,101 INFO L168 Benchmark]: Toolchain (without parser) took 12985.97 ms. Allocated memory was 255.9 MB in the beginning and 620.8 MB in the end (delta: 364.9 MB). Free memory was 235.2 MB in the beginning and 509.1 MB in the end (delta: -273.8 MB). Peak memory consumption was 90.7 MB. Max. memory is 16.0 GB. [2021-03-11 20:04:44,101 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 255.9 MB. Free memory is still 237.3 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 20:04:44,101 INFO L168 Benchmark]: CACSL2BoogieTranslator took 495.35 ms. Allocated memory was 255.9 MB in the beginning and 341.8 MB in the end (delta: 86.0 MB). Free memory was 234.3 MB in the beginning and 300.9 MB in the end (delta: -66.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. [2021-03-11 20:04:44,102 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.18 ms. Allocated memory is still 341.8 MB. Free memory was 300.9 MB in the beginning and 297.3 MB in the end (delta: 3.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-11 20:04:44,102 INFO L168 Benchmark]: Boogie Preprocessor took 24.70 ms. Allocated memory is still 341.8 MB. Free memory was 297.3 MB in the beginning and 294.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:04:44,102 INFO L168 Benchmark]: RCFGBuilder took 1779.14 ms. Allocated memory was 341.8 MB in the beginning and 411.0 MB in the end (delta: 69.2 MB). Free memory was 294.9 MB in the beginning and 304.9 MB in the end (delta: -10.0 MB). Peak memory consumption was 60.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:04:44,103 INFO L168 Benchmark]: TraceAbstraction took 10632.26 ms. Allocated memory was 411.0 MB in the beginning and 620.8 MB in the end (delta: 209.7 MB). Free memory was 304.9 MB in the beginning and 509.1 MB in the end (delta: -204.2 MB). Peak memory consumption was 6.6 MB. Max. memory is 16.0 GB. [2021-03-11 20:04:44,104 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.09 ms. Allocated memory is still 255.9 MB. Free memory is still 237.3 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 495.35 ms. Allocated memory was 255.9 MB in the beginning and 341.8 MB in the end (delta: 86.0 MB). Free memory was 234.3 MB in the beginning and 300.9 MB in the end (delta: -66.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 46.18 ms. Allocated memory is still 341.8 MB. Free memory was 300.9 MB in the beginning and 297.3 MB in the end (delta: 3.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 24.70 ms. Allocated memory is still 341.8 MB. Free memory was 297.3 MB in the beginning and 294.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1779.14 ms. Allocated memory was 341.8 MB in the beginning and 411.0 MB in the end (delta: 69.2 MB). Free memory was 294.9 MB in the beginning and 304.9 MB in the end (delta: -10.0 MB). Peak memory consumption was 60.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 10632.26 ms. Allocated memory was 411.0 MB in the beginning and 620.8 MB in the end (delta: 209.7 MB). Free memory was 304.9 MB in the beginning and 509.1 MB in the end (delta: -204.2 MB). Peak memory consumption was 6.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8639.7ms, 85 PlacesBefore, 26 PlacesAfterwards, 80 TransitionsBefore, 20 TransitionsAfterwards, 982 CoEnabledTransitionPairs, 6 FixpointIterations, 33 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 70 TotalNumberOfCompositions, 2387 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1101, positive: 987, positive conditional: 0, positive unconditional: 987, negative: 114, negative conditional: 0, negative unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 648, positive: 610, positive conditional: 0, positive unconditional: 610, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 648, positive: 589, positive conditional: 0, positive unconditional: 589, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 59, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 755, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 717, negative conditional: 0, negative unconditional: 717, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1101, positive: 377, positive conditional: 0, positive unconditional: 377, negative: 76, negative conditional: 0, negative unconditional: 76, unknown: 648, unknown conditional: 0, unknown unconditional: 648] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 61, Positive conditional cache size: 0, Positive unconditional cache size: 61, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t597; [L811] FCALL, FORK 0 pthread_create(&t597, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L812] 0 pthread_t t598; [L813] FCALL, FORK 0 pthread_create(&t598, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 2 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L763] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L769] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 2 x$flush_delayed = weak$$choice2 [L772] 2 x$mem_tmp = x [L773] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1 [L773] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L773] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L774] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L774] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L775] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L775] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L776] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L776] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L777] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L778] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L779] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 __unbuffered_p1_EAX = x [L781] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L781] 2 x = x$flush_delayed ? x$mem_tmp : x [L782] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L785] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L738] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L744] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L744] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L745] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L746] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L747] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L748] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L788] 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) [L788] 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) [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 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 [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L792] 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 [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L819] 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) [L819] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L819] 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) [L819] 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) [L820] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L820] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L821] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L821] 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 [L822] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L822] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L823] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L823] 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 [L826] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 0 x$flush_delayed = weak$$choice2 [L829] 0 x$mem_tmp = x [L830] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L830] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L831] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L831] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L831] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L832] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L832] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L832] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L832] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L833] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L833] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L833] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L833] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L834] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L834] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L835] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L835] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L835] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L836] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L836] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L838] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L838] 0 x = x$flush_delayed ? x$mem_tmp : x [L839] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 81 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 10457.9ms, OverallIterations: 8, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 750.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8716.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 36 SDtfs, 32 SDslu, 40 SDs, 0 SdLazy, 231 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 252.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 238.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=4, InterpolantAutomatonStates: 39, 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: 20.4ms SsaConstructionTime, 330.1ms SatisfiabilityAnalysisTime, 391.0ms InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 335 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...