/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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe005_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-10 12:24:24,354 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-10 12:24:24,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-10 12:24:24,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-10 12:24:24,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-10 12:24:24,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-10 12:24:24,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-10 12:24:24,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-10 12:24:24,394 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-10 12:24:24,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-10 12:24:24,398 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-10 12:24:24,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-10 12:24:24,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-10 12:24:24,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-10 12:24:24,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-10 12:24:24,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-10 12:24:24,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-10 12:24:24,404 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-10 12:24:24,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-10 12:24:24,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-10 12:24:24,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-10 12:24:24,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-10 12:24:24,413 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-10 12:24:24,413 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-10 12:24:24,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-10 12:24:24,418 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-10 12:24:24,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-10 12:24:24,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-10 12:24:24,419 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-10 12:24:24,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-10 12:24:24,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-10 12:24:24,421 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-10 12:24:24,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-10 12:24:24,422 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-10 12:24:24,423 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-10 12:24:24,423 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-10 12:24:24,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-10 12:24:24,423 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-10 12:24:24,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-10 12:24:24,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-10 12:24:24,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-10 12:24:24,427 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2021-06-10 12:24:24,453 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-10 12:24:24,453 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-10 12:24:24,455 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-10 12:24:24,455 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-10 12:24:24,455 INFO L138 SettingsManager]: * Use SBE=true [2021-06-10 12:24:24,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-10 12:24:24,455 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-10 12:24:24,455 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-10 12:24:24,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-10 12:24:24,456 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-10 12:24:24,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-10 12:24:24,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-10 12:24:24,457 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-10 12:24:24,457 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-10 12:24:24,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-10 12:24:24,457 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-10 12:24:24,457 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-10 12:24:24,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-10 12:24:24,457 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-10 12:24:24,457 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-10 12:24:24,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-10 12:24:24,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-10 12:24:24,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-10 12:24:24,458 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-10 12:24:24,458 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-10 12:24:24,458 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-10 12:24:24,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-10 12:24:24,458 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-10 12:24:24,458 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-10 12:24:24,458 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-10 12:24:24,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-10 12:24:24,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-10 12:24:24,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-10 12:24:24,697 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-10 12:24:24,698 INFO L275 PluginConnector]: CDTParser initialized [2021-06-10 12:24:24,698 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_pso.opt.i [2021-06-10 12:24:24,738 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d931d36a0/b51a0e44f6e3460d81251fd401d21eb2/FLAGc74171eb4 [2021-06-10 12:24:25,185 INFO L306 CDTParser]: Found 1 translation units. [2021-06-10 12:24:25,185 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_pso.opt.i [2021-06-10 12:24:25,198 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d931d36a0/b51a0e44f6e3460d81251fd401d21eb2/FLAGc74171eb4 [2021-06-10 12:24:25,213 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d931d36a0/b51a0e44f6e3460d81251fd401d21eb2 [2021-06-10 12:24:25,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-10 12:24:25,216 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-10 12:24:25,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-10 12:24:25,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-10 12:24:25,220 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-10 12:24:25,221 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 12:24:25" (1/1) ... [2021-06-10 12:24:25,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@137788d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:24:25, skipping insertion in model container [2021-06-10 12:24:25,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 12:24:25" (1/1) ... [2021-06-10 12:24:25,226 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-10 12:24:25,263 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-10 12:24:25,400 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/safe005_pso.opt.i[992,1005] [2021-06-10 12:24:25,542 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 12:24:25,549 INFO L203 MainTranslator]: Completed pre-run [2021-06-10 12:24:25,559 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/safe005_pso.opt.i[992,1005] [2021-06-10 12:24:25,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 12:24:25,665 INFO L208 MainTranslator]: Completed translation [2021-06-10 12:24:25,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:24:25 WrapperNode [2021-06-10 12:24:25,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-10 12:24:25,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-10 12:24:25,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-10 12:24:25,668 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-10 12:24:25,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:24:25" (1/1) ... [2021-06-10 12:24:25,698 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:24:25" (1/1) ... [2021-06-10 12:24:25,714 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-10 12:24:25,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-10 12:24:25,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-10 12:24:25,715 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-10 12:24:25,720 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:24:25" (1/1) ... [2021-06-10 12:24:25,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:24:25" (1/1) ... [2021-06-10 12:24:25,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:24:25" (1/1) ... [2021-06-10 12:24:25,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:24:25" (1/1) ... [2021-06-10 12:24:25,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:24:25" (1/1) ... [2021-06-10 12:24:25,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:24:25" (1/1) ... [2021-06-10 12:24:25,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:24:25" (1/1) ... [2021-06-10 12:24:25,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-10 12:24:25,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-10 12:24:25,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-10 12:24:25,735 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-10 12:24:25,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:24:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-10 12:24:25,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-10 12:24:25,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-10 12:24:25,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-10 12:24:25,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-10 12:24:25,796 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-10 12:24:25,796 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-10 12:24:25,796 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-10 12:24:25,797 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-10 12:24:25,797 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-10 12:24:25,797 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-10 12:24:25,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-10 12:24:25,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-10 12:24:25,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-10 12:24:25,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-10 12:24:25,798 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-10 12:24:27,042 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-10 12:24:27,042 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-10 12:24:27,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 12:24:27 BoogieIcfgContainer [2021-06-10 12:24:27,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-10 12:24:27,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-10 12:24:27,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-10 12:24:27,046 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-10 12:24:27,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.06 12:24:25" (1/3) ... [2021-06-10 12:24:27,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9b7cb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 12:24:27, skipping insertion in model container [2021-06-10 12:24:27,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:24:25" (2/3) ... [2021-06-10 12:24:27,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9b7cb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 12:24:27, skipping insertion in model container [2021-06-10 12:24:27,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 12:24:27" (3/3) ... [2021-06-10 12:24:27,048 INFO L111 eAbstractionObserver]: Analyzing ICFG safe005_pso.opt.i [2021-06-10 12:24:27,052 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-10 12:24:27,055 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-10 12:24:27,055 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-10 12:24:27,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,085 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,085 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,085 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,085 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,095 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,096 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,096 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,096 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,096 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,097 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,097 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,097 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,097 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,097 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,097 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,100 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,101 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,101 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,107 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,108 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,108 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,108 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,108 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,108 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,111 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,111 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,114 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,114 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,114 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,115 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,116 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,116 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:24:27,117 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 12:24:27,128 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-10 12:24:27,149 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 12:24:27,149 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 12:24:27,149 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 12:24:27,149 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 12:24:27,149 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 12:24:27,149 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 12:24:27,149 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 12:24:27,149 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 12:24:27,158 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-06-10 12:24:27,189 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-06-10 12:24:27,189 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 12:24:27,194 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-06-10 12:24:27,194 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-06-10 12:24:27,197 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-06-10 12:24:27,209 INFO L129 PetriNetUnfolder]: 0/50 cut-off events. [2021-06-10 12:24:27,209 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 12:24:27,210 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:24:27,210 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:24:27,210 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:24:27,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:24:27,213 INFO L82 PathProgramCache]: Analyzing trace with hash 661540768, now seen corresponding path program 1 times [2021-06-10 12:24:27,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:24:27,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917041909] [2021-06-10 12:24:27,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:24:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:24:27,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:27,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:24:27,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:27,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:24:27,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:24:27,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917041909] [2021-06-10 12:24:27,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:24:27,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-10 12:24:27,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621919441] [2021-06-10 12:24:27,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 12:24:27,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:24:27,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 12:24:27,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 12:24:27,407 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 97 [2021-06-10 12:24:27,409 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 94 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:27,409 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:24:27,409 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 97 [2021-06-10 12:24:27,410 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:24:27,462 INFO L129 PetriNetUnfolder]: 29/215 cut-off events. [2021-06-10 12:24:27,462 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 12:24:27,463 INFO L84 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 215 events. 29/215 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 769 event pairs, 15 based on Foata normal form. 12/212 useless extension candidates. Maximal degree in co-relation 233. Up to 41 conditions per place. [2021-06-10 12:24:27,464 INFO L132 encePairwiseOnDemand]: 92/97 looper letters, 7 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2021-06-10 12:24:27,464 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 93 transitions, 213 flow [2021-06-10 12:24:27,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 12:24:27,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 12:24:27,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2021-06-10 12:24:27,472 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9450171821305842 [2021-06-10 12:24:27,472 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 275 transitions. [2021-06-10 12:24:27,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 275 transitions. [2021-06-10 12:24:27,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:24:27,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 275 transitions. [2021-06-10 12:24:27,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:27,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:27,480 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:27,481 INFO L185 Difference]: Start difference. First operand has 102 places, 94 transitions, 197 flow. Second operand 3 states and 275 transitions. [2021-06-10 12:24:27,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 93 transitions, 213 flow [2021-06-10 12:24:27,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 93 transitions, 210 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-10 12:24:27,485 INFO L241 Difference]: Finished difference. Result has 99 places, 90 transitions, 190 flow [2021-06-10 12:24:27,486 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=99, PETRI_TRANSITIONS=90} [2021-06-10 12:24:27,486 INFO L343 CegarLoopForPetriNet]: 102 programPoint places, -3 predicate places. [2021-06-10 12:24:27,487 INFO L480 AbstractCegarLoop]: Abstraction has has 99 places, 90 transitions, 190 flow [2021-06-10 12:24:27,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:27,487 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:24:27,487 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:24:27,487 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-10 12:24:27,487 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:24:27,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:24:27,487 INFO L82 PathProgramCache]: Analyzing trace with hash 670194587, now seen corresponding path program 1 times [2021-06-10 12:24:27,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:24:27,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700829724] [2021-06-10 12:24:27,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:24:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:24:27,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:27,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:24:27,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:27,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:24:27,563 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-06-10 12:24:27,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-10 12:24:27,571 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:24:27,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:24:27,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:27,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:24:27,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:27,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:24:27,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:27,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:24:27,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:24:27,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700829724] [2021-06-10 12:24:27,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:24:27,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-10 12:24:27,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764861188] [2021-06-10 12:24:27,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-10 12:24:27,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:24:27,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-10 12:24:27,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-10 12:24:27,602 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 97 [2021-06-10 12:24:27,602 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 90 transitions, 190 flow. Second operand has 7 states, 7 states have (on average 79.42857142857143) internal successors, (556), 7 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:27,602 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:24:27,602 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 97 [2021-06-10 12:24:27,602 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:24:27,873 INFO L129 PetriNetUnfolder]: 225/803 cut-off events. [2021-06-10 12:24:27,874 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 12:24:27,875 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1211 conditions, 803 events. 225/803 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5158 event pairs, 9 based on Foata normal form. 0/776 useless extension candidates. Maximal degree in co-relation 1162. Up to 78 conditions per place. [2021-06-10 12:24:27,877 INFO L132 encePairwiseOnDemand]: 87/97 looper letters, 17 selfloop transitions, 6 changer transitions 56/144 dead transitions. [2021-06-10 12:24:27,877 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 144 transitions, 438 flow [2021-06-10 12:24:27,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-10 12:24:27,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-06-10 12:24:27,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1087 transitions. [2021-06-10 12:24:27,881 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8620142743854085 [2021-06-10 12:24:27,881 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1087 transitions. [2021-06-10 12:24:27,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1087 transitions. [2021-06-10 12:24:27,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:24:27,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1087 transitions. [2021-06-10 12:24:27,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 83.61538461538461) internal successors, (1087), 13 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:27,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 97.0) internal successors, (1358), 14 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:27,888 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 97.0) internal successors, (1358), 14 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:27,888 INFO L185 Difference]: Start difference. First operand has 99 places, 90 transitions, 190 flow. Second operand 13 states and 1087 transitions. [2021-06-10 12:24:27,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 144 transitions, 438 flow [2021-06-10 12:24:27,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 144 transitions, 434 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 12:24:27,891 INFO L241 Difference]: Finished difference. Result has 121 places, 83 transitions, 242 flow [2021-06-10 12:24:27,891 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=242, PETRI_PLACES=121, PETRI_TRANSITIONS=83} [2021-06-10 12:24:27,891 INFO L343 CegarLoopForPetriNet]: 102 programPoint places, 19 predicate places. [2021-06-10 12:24:27,891 INFO L480 AbstractCegarLoop]: Abstraction has has 121 places, 83 transitions, 242 flow [2021-06-10 12:24:27,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 79.42857142857143) internal successors, (556), 7 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:27,892 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:24:27,892 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:24:27,892 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-10 12:24:27,892 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:24:27,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:24:27,892 INFO L82 PathProgramCache]: Analyzing trace with hash 351734073, now seen corresponding path program 1 times [2021-06-10 12:24:27,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:24:27,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755980748] [2021-06-10 12:24:27,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:24:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:24:27,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:27,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:24:27,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:27,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:24:27,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:27,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:24:27,972 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:24:27,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:24:27,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:27,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:24:28,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:28,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:24:28,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:28,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:24:28,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:24:28,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755980748] [2021-06-10 12:24:28,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:24:28,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-10 12:24:28,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230841494] [2021-06-10 12:24:28,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-10 12:24:28,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:24:28,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-10 12:24:28,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-10 12:24:28,019 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 97 [2021-06-10 12:24:28,020 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 83 transitions, 242 flow. Second operand has 7 states, 7 states have (on average 82.57142857142857) internal successors, (578), 7 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:28,020 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:24:28,020 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 97 [2021-06-10 12:24:28,020 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:24:28,115 INFO L129 PetriNetUnfolder]: 36/262 cut-off events. [2021-06-10 12:24:28,116 INFO L130 PetriNetUnfolder]: For 416/665 co-relation queries the response was YES. [2021-06-10 12:24:28,117 INFO L84 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 262 events. 36/262 cut-off events. For 416/665 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1228 event pairs, 6 based on Foata normal form. 7/262 useless extension candidates. Maximal degree in co-relation 608. Up to 39 conditions per place. [2021-06-10 12:24:28,117 INFO L132 encePairwiseOnDemand]: 88/97 looper letters, 13 selfloop transitions, 5 changer transitions 13/100 dead transitions. [2021-06-10 12:24:28,117 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 100 transitions, 418 flow [2021-06-10 12:24:28,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 12:24:28,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 12:24:28,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 594 transitions. [2021-06-10 12:24:28,119 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8748159057437408 [2021-06-10 12:24:28,119 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 594 transitions. [2021-06-10 12:24:28,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 594 transitions. [2021-06-10 12:24:28,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:24:28,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 594 transitions. [2021-06-10 12:24:28,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 84.85714285714286) internal successors, (594), 7 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:28,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 97.0) internal successors, (776), 8 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:28,122 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 97.0) internal successors, (776), 8 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:28,122 INFO L185 Difference]: Start difference. First operand has 121 places, 83 transitions, 242 flow. Second operand 7 states and 594 transitions. [2021-06-10 12:24:28,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 100 transitions, 418 flow [2021-06-10 12:24:28,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 100 transitions, 376 flow, removed 19 selfloop flow, removed 4 redundant places. [2021-06-10 12:24:28,126 INFO L241 Difference]: Finished difference. Result has 109 places, 85 transitions, 268 flow [2021-06-10 12:24:28,126 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=268, PETRI_PLACES=109, PETRI_TRANSITIONS=85} [2021-06-10 12:24:28,126 INFO L343 CegarLoopForPetriNet]: 102 programPoint places, 7 predicate places. [2021-06-10 12:24:28,126 INFO L480 AbstractCegarLoop]: Abstraction has has 109 places, 85 transitions, 268 flow [2021-06-10 12:24:28,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 82.57142857142857) internal successors, (578), 7 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:28,126 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:24:28,126 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:24:28,126 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-10 12:24:28,127 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:24:28,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:24:28,127 INFO L82 PathProgramCache]: Analyzing trace with hash 381709479, now seen corresponding path program 1 times [2021-06-10 12:24:28,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:24:28,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131314847] [2021-06-10 12:24:28,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:24:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:24:28,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:28,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:24:28,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:28,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:24:28,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:28,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:24:28,228 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-06-10 12:24:28,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-10 12:24:28,237 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:24:28,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:24:28,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:28,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:24:28,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:28,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:24:28,267 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:28,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:24:28,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:24:28,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131314847] [2021-06-10 12:24:28,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:24:28,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-10 12:24:28,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33429164] [2021-06-10 12:24:28,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-10 12:24:28,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:24:28,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-10 12:24:28,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-06-10 12:24:28,271 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 97 [2021-06-10 12:24:28,271 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 85 transitions, 268 flow. Second operand has 8 states, 8 states have (on average 79.75) internal successors, (638), 8 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:28,271 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:24:28,271 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 97 [2021-06-10 12:24:28,271 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:24:28,445 INFO L129 PetriNetUnfolder]: 18/240 cut-off events. [2021-06-10 12:24:28,445 INFO L130 PetriNetUnfolder]: For 326/554 co-relation queries the response was YES. [2021-06-10 12:24:28,446 INFO L84 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 240 events. 18/240 cut-off events. For 326/554 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1102 event pairs, 5 based on Foata normal form. 10/245 useless extension candidates. Maximal degree in co-relation 530. Up to 29 conditions per place. [2021-06-10 12:24:28,446 INFO L132 encePairwiseOnDemand]: 87/97 looper letters, 18 selfloop transitions, 7 changer transitions 22/112 dead transitions. [2021-06-10 12:24:28,446 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 112 transitions, 533 flow [2021-06-10 12:24:28,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-10 12:24:28,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-06-10 12:24:28,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1059 transitions. [2021-06-10 12:24:28,448 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8398096748612213 [2021-06-10 12:24:28,448 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1059 transitions. [2021-06-10 12:24:28,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1059 transitions. [2021-06-10 12:24:28,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:24:28,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1059 transitions. [2021-06-10 12:24:28,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 81.46153846153847) internal successors, (1059), 13 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:28,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 97.0) internal successors, (1358), 14 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:28,452 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 97.0) internal successors, (1358), 14 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:28,452 INFO L185 Difference]: Start difference. First operand has 109 places, 85 transitions, 268 flow. Second operand 13 states and 1059 transitions. [2021-06-10 12:24:28,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 112 transitions, 533 flow [2021-06-10 12:24:28,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 112 transitions, 481 flow, removed 24 selfloop flow, removed 7 redundant places. [2021-06-10 12:24:28,455 INFO L241 Difference]: Finished difference. Result has 123 places, 85 transitions, 300 flow [2021-06-10 12:24:28,455 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=300, PETRI_PLACES=123, PETRI_TRANSITIONS=85} [2021-06-10 12:24:28,455 INFO L343 CegarLoopForPetriNet]: 102 programPoint places, 21 predicate places. [2021-06-10 12:24:28,455 INFO L480 AbstractCegarLoop]: Abstraction has has 123 places, 85 transitions, 300 flow [2021-06-10 12:24:28,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 79.75) internal successors, (638), 8 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:28,456 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:24:28,456 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:24:28,456 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-10 12:24:28,456 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:24:28,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:24:28,456 INFO L82 PathProgramCache]: Analyzing trace with hash -584881820, now seen corresponding path program 1 times [2021-06-10 12:24:28,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:24:28,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935584476] [2021-06-10 12:24:28,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:24:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:24:28,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:28,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:24:28,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:28,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:24:28,502 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-10 12:24:28,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-10 12:24:28,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:28,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:24:28,523 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-10 12:24:28,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:24:28,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:28,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:24:28,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:24:28,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935584476] [2021-06-10 12:24:28,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:24:28,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-10 12:24:28,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948992479] [2021-06-10 12:24:28,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 12:24:28,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:24:28,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 12:24:28,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-10 12:24:28,535 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 97 [2021-06-10 12:24:28,535 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 85 transitions, 300 flow. Second operand has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:28,535 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:24:28,536 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 97 [2021-06-10 12:24:28,536 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:24:28,691 INFO L129 PetriNetUnfolder]: 353/914 cut-off events. [2021-06-10 12:24:28,691 INFO L130 PetriNetUnfolder]: For 587/595 co-relation queries the response was YES. [2021-06-10 12:24:28,694 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1931 conditions, 914 events. 353/914 cut-off events. For 587/595 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 6348 event pairs, 18 based on Foata normal form. 3/847 useless extension candidates. Maximal degree in co-relation 1859. Up to 244 conditions per place. [2021-06-10 12:24:28,696 INFO L132 encePairwiseOnDemand]: 87/97 looper letters, 13 selfloop transitions, 8 changer transitions 20/115 dead transitions. [2021-06-10 12:24:28,697 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 115 transitions, 442 flow [2021-06-10 12:24:28,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-10 12:24:28,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-06-10 12:24:28,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 873 transitions. [2021-06-10 12:24:28,698 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9 [2021-06-10 12:24:28,698 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 873 transitions. [2021-06-10 12:24:28,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 873 transitions. [2021-06-10 12:24:28,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:24:28,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 873 transitions. [2021-06-10 12:24:28,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 87.3) internal successors, (873), 10 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:28,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:28,702 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:28,702 INFO L185 Difference]: Start difference. First operand has 123 places, 85 transitions, 300 flow. Second operand 10 states and 873 transitions. [2021-06-10 12:24:28,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 115 transitions, 442 flow [2021-06-10 12:24:28,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 115 transitions, 391 flow, removed 16 selfloop flow, removed 14 redundant places. [2021-06-10 12:24:28,706 INFO L241 Difference]: Finished difference. Result has 117 places, 91 transitions, 325 flow [2021-06-10 12:24:28,706 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=325, PETRI_PLACES=117, PETRI_TRANSITIONS=91} [2021-06-10 12:24:28,707 INFO L343 CegarLoopForPetriNet]: 102 programPoint places, 15 predicate places. [2021-06-10 12:24:28,707 INFO L480 AbstractCegarLoop]: Abstraction has has 117 places, 91 transitions, 325 flow [2021-06-10 12:24:28,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:28,707 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:24:28,707 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:24:28,707 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-10 12:24:28,707 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:24:28,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:24:28,707 INFO L82 PathProgramCache]: Analyzing trace with hash -444186463, now seen corresponding path program 1 times [2021-06-10 12:24:28,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:24:28,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234718458] [2021-06-10 12:24:28,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:24:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:24:28,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:28,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:24:28,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:28,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:24:28,774 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-06-10 12:24:28,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-10 12:24:28,783 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:24:28,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:24:28,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:28,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:24:28,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:28,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:24:28,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:28,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:24:28,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:24:28,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234718458] [2021-06-10 12:24:28,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:24:28,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-10 12:24:28,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227396034] [2021-06-10 12:24:28,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-10 12:24:28,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:24:28,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-10 12:24:28,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-10 12:24:28,810 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 97 [2021-06-10 12:24:28,810 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 91 transitions, 325 flow. Second operand has 7 states, 7 states have (on average 80.14285714285714) internal successors, (561), 7 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:28,810 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:24:28,810 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 97 [2021-06-10 12:24:28,811 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:24:28,922 INFO L129 PetriNetUnfolder]: 131/558 cut-off events. [2021-06-10 12:24:28,922 INFO L130 PetriNetUnfolder]: For 832/941 co-relation queries the response was YES. [2021-06-10 12:24:28,924 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1537 conditions, 558 events. 131/558 cut-off events. For 832/941 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3557 event pairs, 66 based on Foata normal form. 21/549 useless extension candidates. Maximal degree in co-relation 1466. Up to 179 conditions per place. [2021-06-10 12:24:28,925 INFO L132 encePairwiseOnDemand]: 89/97 looper letters, 12 selfloop transitions, 3 changer transitions 13/95 dead transitions. [2021-06-10 12:24:28,925 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 95 transitions, 391 flow [2021-06-10 12:24:28,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 12:24:28,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 12:24:28,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 570 transitions. [2021-06-10 12:24:28,927 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8394698085419735 [2021-06-10 12:24:28,927 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 570 transitions. [2021-06-10 12:24:28,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 570 transitions. [2021-06-10 12:24:28,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:24:28,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 570 transitions. [2021-06-10 12:24:28,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 81.42857142857143) internal successors, (570), 7 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:28,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 97.0) internal successors, (776), 8 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:28,929 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 97.0) internal successors, (776), 8 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:28,929 INFO L185 Difference]: Start difference. First operand has 117 places, 91 transitions, 325 flow. Second operand 7 states and 570 transitions. [2021-06-10 12:24:28,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 95 transitions, 391 flow [2021-06-10 12:24:28,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 95 transitions, 383 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-06-10 12:24:28,932 INFO L241 Difference]: Finished difference. Result has 120 places, 82 transitions, 282 flow [2021-06-10 12:24:28,932 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=282, PETRI_PLACES=120, PETRI_TRANSITIONS=82} [2021-06-10 12:24:28,932 INFO L343 CegarLoopForPetriNet]: 102 programPoint places, 18 predicate places. [2021-06-10 12:24:28,932 INFO L480 AbstractCegarLoop]: Abstraction has has 120 places, 82 transitions, 282 flow [2021-06-10 12:24:28,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 80.14285714285714) internal successors, (561), 7 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:28,932 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:24:28,932 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:24:28,933 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-10 12:24:28,933 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:24:28,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:24:28,933 INFO L82 PathProgramCache]: Analyzing trace with hash 224147435, now seen corresponding path program 2 times [2021-06-10 12:24:28,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:24:28,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445764570] [2021-06-10 12:24:28,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:24:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:24:28,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:28,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:24:28,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:28,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:24:28,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:28,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:24:28,975 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-10 12:24:28,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-10 12:24:28,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:28,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:24:28,993 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-10 12:24:28,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:24:29,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:29,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:24:29,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:24:29,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445764570] [2021-06-10 12:24:29,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:24:29,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-10 12:24:29,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554397315] [2021-06-10 12:24:29,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-10 12:24:29,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:24:29,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-10 12:24:29,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-10 12:24:29,002 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 97 [2021-06-10 12:24:29,003 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 82 transitions, 282 flow. Second operand has 7 states, 7 states have (on average 84.14285714285714) internal successors, (589), 7 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:29,003 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:24:29,003 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 97 [2021-06-10 12:24:29,003 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:24:29,118 INFO L129 PetriNetUnfolder]: 57/242 cut-off events. [2021-06-10 12:24:29,118 INFO L130 PetriNetUnfolder]: For 382/404 co-relation queries the response was YES. [2021-06-10 12:24:29,119 INFO L84 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 242 events. 57/242 cut-off events. For 382/404 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 887 event pairs, 4 based on Foata normal form. 13/251 useless extension candidates. Maximal degree in co-relation 664. Up to 76 conditions per place. [2021-06-10 12:24:29,119 INFO L132 encePairwiseOnDemand]: 88/97 looper letters, 10 selfloop transitions, 9 changer transitions 19/107 dead transitions. [2021-06-10 12:24:29,119 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 107 transitions, 531 flow [2021-06-10 12:24:29,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-10 12:24:29,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-06-10 12:24:29,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 870 transitions. [2021-06-10 12:24:29,121 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8969072164948454 [2021-06-10 12:24:29,121 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 870 transitions. [2021-06-10 12:24:29,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 870 transitions. [2021-06-10 12:24:29,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:24:29,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 870 transitions. [2021-06-10 12:24:29,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 87.0) internal successors, (870), 10 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:29,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:29,124 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 97.0) internal successors, (1067), 11 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:29,124 INFO L185 Difference]: Start difference. First operand has 120 places, 82 transitions, 282 flow. Second operand 10 states and 870 transitions. [2021-06-10 12:24:29,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 107 transitions, 531 flow [2021-06-10 12:24:29,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 107 transitions, 484 flow, removed 12 selfloop flow, removed 13 redundant places. [2021-06-10 12:24:29,126 INFO L241 Difference]: Finished difference. Result has 115 places, 85 transitions, 323 flow [2021-06-10 12:24:29,126 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=323, PETRI_PLACES=115, PETRI_TRANSITIONS=85} [2021-06-10 12:24:29,127 INFO L343 CegarLoopForPetriNet]: 102 programPoint places, 13 predicate places. [2021-06-10 12:24:29,127 INFO L480 AbstractCegarLoop]: Abstraction has has 115 places, 85 transitions, 323 flow [2021-06-10 12:24:29,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 84.14285714285714) internal successors, (589), 7 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:29,127 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:24:29,127 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:24:29,127 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-10 12:24:29,127 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:24:29,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:24:29,127 INFO L82 PathProgramCache]: Analyzing trace with hash 738649630, now seen corresponding path program 1 times [2021-06-10 12:24:29,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:24:29,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293555576] [2021-06-10 12:24:29,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:24:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:24:29,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:29,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:24:29,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:29,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:24:29,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:29,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:24:29,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:29,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:24:29,196 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-10 12:24:29,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-10 12:24:29,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:29,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:24:29,214 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-10 12:24:29,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:24:29,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:24:29,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:24:29,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:24:29,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293555576] [2021-06-10 12:24:29,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:24:29,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-10 12:24:29,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133061276] [2021-06-10 12:24:29,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-10 12:24:29,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:24:29,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-10 12:24:29,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-10 12:24:29,223 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 97 [2021-06-10 12:24:29,223 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 85 transitions, 323 flow. Second operand has 8 states, 8 states have (on average 84.125) internal successors, (673), 8 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:29,223 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:24:29,223 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 97 [2021-06-10 12:24:29,223 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:24:29,334 INFO L129 PetriNetUnfolder]: 16/125 cut-off events. [2021-06-10 12:24:29,334 INFO L130 PetriNetUnfolder]: For 351/367 co-relation queries the response was YES. [2021-06-10 12:24:29,334 INFO L84 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 125 events. 16/125 cut-off events. For 351/367 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 213 event pairs, 0 based on Foata normal form. 12/136 useless extension candidates. Maximal degree in co-relation 351. Up to 30 conditions per place. [2021-06-10 12:24:29,335 INFO L132 encePairwiseOnDemand]: 88/97 looper letters, 4 selfloop transitions, 12 changer transitions 13/98 dead transitions. [2021-06-10 12:24:29,335 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 98 transitions, 507 flow [2021-06-10 12:24:29,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-10 12:24:29,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-06-10 12:24:29,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 944 transitions. [2021-06-10 12:24:29,337 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8847235238987816 [2021-06-10 12:24:29,337 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 944 transitions. [2021-06-10 12:24:29,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 944 transitions. [2021-06-10 12:24:29,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:24:29,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 944 transitions. [2021-06-10 12:24:29,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 85.81818181818181) internal successors, (944), 11 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:29,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 97.0) internal successors, (1164), 12 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:29,340 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 97.0) internal successors, (1164), 12 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:29,340 INFO L185 Difference]: Start difference. First operand has 115 places, 85 transitions, 323 flow. Second operand 11 states and 944 transitions. [2021-06-10 12:24:29,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 98 transitions, 507 flow [2021-06-10 12:24:29,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 98 transitions, 388 flow, removed 47 selfloop flow, removed 14 redundant places. [2021-06-10 12:24:29,342 INFO L241 Difference]: Finished difference. Result has 113 places, 85 transitions, 289 flow [2021-06-10 12:24:29,342 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=289, PETRI_PLACES=113, PETRI_TRANSITIONS=85} [2021-06-10 12:24:29,342 INFO L343 CegarLoopForPetriNet]: 102 programPoint places, 11 predicate places. [2021-06-10 12:24:29,342 INFO L480 AbstractCegarLoop]: Abstraction has has 113 places, 85 transitions, 289 flow [2021-06-10 12:24:29,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 84.125) internal successors, (673), 8 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:24:29,343 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:24:29,343 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-10 12:24:29,343 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-10 12:24:29,343 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:24:29,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:24:29,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1684838283, now seen corresponding path program 1 times [2021-06-10 12:24:29,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:24:29,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097382577] [2021-06-10 12:24:29,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:24:29,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 12:24:29,383 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 12:24:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 12:24:29,423 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 12:24:29,458 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 12:24:29,458 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 12:24:29,459 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-10 12:24:29,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.06 12:24:29 BasicIcfg [2021-06-10 12:24:29,555 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-10 12:24:29,557 INFO L168 Benchmark]: Toolchain (without parser) took 4340.02 ms. Allocated memory was 356.5 MB in the beginning and 444.6 MB in the end (delta: 88.1 MB). Free memory was 319.4 MB in the beginning and 166.4 MB in the end (delta: 153.0 MB). Peak memory consumption was 243.1 MB. Max. memory is 16.0 GB. [2021-06-10 12:24:29,558 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 356.5 MB. Free memory was 337.4 MB in the beginning and 337.4 MB in the end (delta: 71.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-10 12:24:29,559 INFO L168 Benchmark]: CACSL2BoogieTranslator took 449.29 ms. Allocated memory is still 356.5 MB. Free memory was 319.2 MB in the beginning and 316.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. [2021-06-10 12:24:29,560 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.30 ms. Allocated memory is still 356.5 MB. Free memory was 316.0 MB in the beginning and 313.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-10 12:24:29,561 INFO L168 Benchmark]: Boogie Preprocessor took 19.45 ms. Allocated memory is still 356.5 MB. Free memory was 313.6 MB in the beginning and 310.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-10 12:24:29,561 INFO L168 Benchmark]: RCFGBuilder took 1308.96 ms. Allocated memory is still 356.5 MB. Free memory was 310.8 MB in the beginning and 277.7 MB in the end (delta: 33.0 MB). Peak memory consumption was 156.8 MB. Max. memory is 16.0 GB. [2021-06-10 12:24:29,562 INFO L168 Benchmark]: TraceAbstraction took 2510.90 ms. Allocated memory was 356.5 MB in the beginning and 444.6 MB in the end (delta: 88.1 MB). Free memory was 277.7 MB in the beginning and 166.4 MB in the end (delta: 111.3 MB). Peak memory consumption was 198.4 MB. Max. memory is 16.0 GB. [2021-06-10 12:24:29,566 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 356.5 MB. Free memory was 337.4 MB in the beginning and 337.4 MB in the end (delta: 71.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 449.29 ms. Allocated memory is still 356.5 MB. Free memory was 319.2 MB in the beginning and 316.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 46.30 ms. Allocated memory is still 356.5 MB. Free memory was 316.0 MB in the beginning and 313.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 19.45 ms. Allocated memory is still 356.5 MB. Free memory was 313.6 MB in the beginning and 310.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1308.96 ms. Allocated memory is still 356.5 MB. Free memory was 310.8 MB in the beginning and 277.7 MB in the end (delta: 33.0 MB). Peak memory consumption was 156.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 2510.90 ms. Allocated memory was 356.5 MB in the beginning and 444.6 MB in the end (delta: 88.1 MB). Free memory was 277.7 MB in the beginning and 166.4 MB in the end (delta: 111.3 MB). Peak memory consumption was 198.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L722] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L723] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L724] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L725] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L726] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L727] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L728] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L729] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L730] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L731] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L732] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L733] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L734] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L735] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L736] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L738] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L739] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L740] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L831] 0 pthread_t t1906; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L832] FCALL, FORK 0 pthread_create(&t1906, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L833] 0 pthread_t t1907; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L834] FCALL, FORK 0 pthread_create(&t1907, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L835] 0 pthread_t t1908; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L836] FCALL, FORK 0 pthread_create(&t1908, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L806] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L744] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L754] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L755] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L756] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L758] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L758] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L759] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L842] 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) [L842] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L842] 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) [L842] 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) [L843] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] 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 [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L846] 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 [L849] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 11.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 2313.5ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1208.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 47.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 93 SDtfs, 193 SDslu, 319 SDs, 0 SdLazy, 349 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 223.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 615.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=5, InterpolantAutomatonStates: 74, 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: 26.6ms SsaConstructionTime, 243.6ms SatisfiabilityAnalysisTime, 585.2ms InterpolantComputationTime, 581 NumberOfCodeBlocks, 581 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 500 ConstructedInterpolants, 0 QuantifiedInterpolants, 1796 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...