/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/mix041_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-10 12:15:38,717 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-10 12:15:38,718 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-10 12:15:38,735 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-10 12:15:38,736 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-10 12:15:38,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-10 12:15:38,737 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-10 12:15:38,738 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-10 12:15:38,739 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-10 12:15:38,740 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-10 12:15:38,740 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-10 12:15:38,741 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-10 12:15:38,741 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-10 12:15:38,742 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-10 12:15:38,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-10 12:15:38,743 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-10 12:15:38,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-10 12:15:38,744 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-10 12:15:38,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-10 12:15:38,746 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-10 12:15:38,747 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-10 12:15:38,747 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-10 12:15:38,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-10 12:15:38,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-10 12:15:38,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-10 12:15:38,750 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-10 12:15:38,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-10 12:15:38,751 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-10 12:15:38,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-10 12:15:38,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-10 12:15:38,752 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-10 12:15:38,752 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-10 12:15:38,753 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-10 12:15:38,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-10 12:15:38,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-10 12:15:38,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-10 12:15:38,754 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-10 12:15:38,754 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-10 12:15:38,755 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-10 12:15:38,755 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-10 12:15:38,755 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-10 12:15:38,756 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:15:38,770 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-10 12:15:38,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-10 12:15:38,771 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-10 12:15:38,771 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-10 12:15:38,771 INFO L138 SettingsManager]: * Use SBE=true [2021-06-10 12:15:38,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-10 12:15:38,772 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-10 12:15:38,772 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-10 12:15:38,772 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-10 12:15:38,772 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-10 12:15:38,772 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-10 12:15:38,772 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-10 12:15:38,772 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-10 12:15:38,773 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-10 12:15:38,773 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-10 12:15:38,773 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-10 12:15:38,773 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-10 12:15:38,773 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-10 12:15:38,773 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-10 12:15:38,773 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-10 12:15:38,773 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-10 12:15:38,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-10 12:15:38,774 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-10 12:15:38,774 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-10 12:15:38,774 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-10 12:15:38,774 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-10 12:15:38,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-10 12:15:38,774 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-10 12:15:38,774 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-10 12:15:38,775 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:15:39,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-10 12:15:39,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-10 12:15:39,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-10 12:15:39,034 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-10 12:15:39,034 INFO L275 PluginConnector]: CDTParser initialized [2021-06-10 12:15:39,035 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_rmo.opt.i [2021-06-10 12:15:39,092 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a61a74c25/2a43ee0954884574a5ce0417b82961c8/FLAG8e428565b [2021-06-10 12:15:39,521 INFO L306 CDTParser]: Found 1 translation units. [2021-06-10 12:15:39,521 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_rmo.opt.i [2021-06-10 12:15:39,536 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a61a74c25/2a43ee0954884574a5ce0417b82961c8/FLAG8e428565b [2021-06-10 12:15:39,550 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a61a74c25/2a43ee0954884574a5ce0417b82961c8 [2021-06-10 12:15:39,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-10 12:15:39,553 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-10 12:15:39,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-10 12:15:39,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-10 12:15:39,566 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-10 12:15:39,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 12:15:39" (1/1) ... [2021-06-10 12:15:39,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12f8a8dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:15:39, skipping insertion in model container [2021-06-10 12:15:39,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.06 12:15:39" (1/1) ... [2021-06-10 12:15:39,573 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-10 12:15:39,614 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-10 12:15:39,754 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/mix041_rmo.opt.i[948,961] [2021-06-10 12:15:39,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 12:15:39,941 INFO L203 MainTranslator]: Completed pre-run [2021-06-10 12:15:39,951 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/mix041_rmo.opt.i[948,961] [2021-06-10 12:15:39,994 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-10 12:15:40,054 INFO L208 MainTranslator]: Completed translation [2021-06-10 12:15:40,054 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:15:40 WrapperNode [2021-06-10 12:15:40,054 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-10 12:15:40,056 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-10 12:15:40,056 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-10 12:15:40,057 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-10 12:15:40,061 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:15:40" (1/1) ... [2021-06-10 12:15:40,085 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:15:40" (1/1) ... [2021-06-10 12:15:40,123 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-10 12:15:40,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-10 12:15:40,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-10 12:15:40,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-10 12:15:40,129 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:15:40" (1/1) ... [2021-06-10 12:15:40,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:15:40" (1/1) ... [2021-06-10 12:15:40,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:15:40" (1/1) ... [2021-06-10 12:15:40,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:15:40" (1/1) ... [2021-06-10 12:15:40,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:15:40" (1/1) ... [2021-06-10 12:15:40,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:15:40" (1/1) ... [2021-06-10 12:15:40,141 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:15:40" (1/1) ... [2021-06-10 12:15:40,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-10 12:15:40,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-10 12:15:40,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-10 12:15:40,144 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-10 12:15:40,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:15:40" (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:15:40,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-10 12:15:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-10 12:15:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-10 12:15:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-10 12:15:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-10 12:15:40,205 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-10 12:15:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-10 12:15:40,205 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-10 12:15:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-10 12:15:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-10 12:15:40,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-10 12:15:40,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-10 12:15:40,207 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:15:41,381 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-10 12:15:41,381 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-10 12:15:41,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 12:15:41 BoogieIcfgContainer [2021-06-10 12:15:41,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-10 12:15:41,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-10 12:15:41,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-10 12:15:41,387 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-10 12:15:41,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.06 12:15:39" (1/3) ... [2021-06-10 12:15:41,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21167b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 12:15:41, skipping insertion in model container [2021-06-10 12:15:41,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.06 12:15:40" (2/3) ... [2021-06-10 12:15:41,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21167b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.06 12:15:41, skipping insertion in model container [2021-06-10 12:15:41,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.06 12:15:41" (3/3) ... [2021-06-10 12:15:41,390 INFO L111 eAbstractionObserver]: Analyzing ICFG mix041_rmo.opt.i [2021-06-10 12:15:41,395 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-10 12:15:41,398 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-10 12:15:41,399 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-10 12:15:41,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,425 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,425 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,425 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,425 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,429 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,429 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,429 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,429 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,429 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,429 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,430 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,430 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,430 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,430 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,430 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,431 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,431 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,431 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,432 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,435 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,435 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,436 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,439 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,439 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-10 12:15:41,440 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-10 12:15:41,452 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-06-10 12:15:41,466 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-10 12:15:41,466 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-10 12:15:41,466 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-10 12:15:41,466 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-10 12:15:41,467 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-10 12:15:41,467 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-10 12:15:41,467 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-10 12:15:41,467 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-10 12:15:41,473 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 84 transitions, 178 flow [2021-06-10 12:15:41,494 INFO L129 PetriNetUnfolder]: 2/82 cut-off events. [2021-06-10 12:15:41,495 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 12:15:41,496 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 82 events. 2/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2021-06-10 12:15:41,497 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 84 transitions, 178 flow [2021-06-10 12:15:41,499 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 82 transitions, 170 flow [2021-06-10 12:15:41,506 INFO L129 PetriNetUnfolder]: 0/48 cut-off events. [2021-06-10 12:15:41,506 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 12:15:41,506 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:15:41,507 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] [2021-06-10 12:15:41,507 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:15:41,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:15:41,511 INFO L82 PathProgramCache]: Analyzing trace with hash -2037806943, now seen corresponding path program 1 times [2021-06-10 12:15:41,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:15:41,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721625201] [2021-06-10 12:15:41,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:15:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:15:41,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:41,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:15:41,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:41,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:15:41,712 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:15:41,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721625201] [2021-06-10 12:15:41,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:15:41,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-10 12:15:41,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92312357] [2021-06-10 12:15:41,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-10 12:15:41,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:15:41,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-10 12:15:41,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-10 12:15:41,730 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 84 [2021-06-10 12:15:41,733 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 82 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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:15:41,734 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:15:41,734 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 84 [2021-06-10 12:15:41,734 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:15:41,813 INFO L129 PetriNetUnfolder]: 16/186 cut-off events. [2021-06-10 12:15:41,813 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 12:15:41,814 INFO L84 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 186 events. 16/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 613 event pairs, 6 based on Foata normal form. 9/184 useless extension candidates. Maximal degree in co-relation 185. Up to 27 conditions per place. [2021-06-10 12:15:41,815 INFO L132 encePairwiseOnDemand]: 79/84 looper letters, 7 selfloop transitions, 2 changer transitions 0/81 dead transitions. [2021-06-10 12:15:41,815 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 81 transitions, 186 flow [2021-06-10 12:15:41,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-10 12:15:41,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-10 12:15:41,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 236 transitions. [2021-06-10 12:15:41,823 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9365079365079365 [2021-06-10 12:15:41,823 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 236 transitions. [2021-06-10 12:15:41,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 236 transitions. [2021-06-10 12:15:41,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:15:41,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 236 transitions. [2021-06-10 12:15:41,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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:15:41,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 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:15:41,831 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 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:15:41,832 INFO L185 Difference]: Start difference. First operand has 87 places, 82 transitions, 170 flow. Second operand 3 states and 236 transitions. [2021-06-10 12:15:41,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 81 transitions, 186 flow [2021-06-10 12:15:41,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 81 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 12:15:41,837 INFO L241 Difference]: Finished difference. Result has 85 places, 78 transitions, 164 flow [2021-06-10 12:15:41,838 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=85, PETRI_TRANSITIONS=78} [2021-06-10 12:15:41,838 INFO L343 CegarLoopForPetriNet]: 87 programPoint places, -2 predicate places. [2021-06-10 12:15:41,838 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 78 transitions, 164 flow [2021-06-10 12:15:41,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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:15:41,839 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:15:41,839 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] [2021-06-10 12:15:41,839 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-10 12:15:41,839 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:15:41,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:15:41,839 INFO L82 PathProgramCache]: Analyzing trace with hash -985420155, now seen corresponding path program 1 times [2021-06-10 12:15:41,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:15:41,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770652542] [2021-06-10 12:15:41,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:15:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:15:41,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:41,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:15:41,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:41,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:15:41,942 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:15:41,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:15:41,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:41,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:15:41,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:41,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:15:41,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:41,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:15:41,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-10 12:15:41,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770652542] [2021-06-10 12:15:41,982 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:15:41,982 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-10 12:15:41,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737236820] [2021-06-10 12:15:41,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 12:15:41,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:15:41,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 12:15:41,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-10 12:15:41,984 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 84 [2021-06-10 12:15:41,985 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 78 transitions, 164 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 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:15:41,985 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:15:41,985 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 84 [2021-06-10 12:15:41,985 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:15:42,091 INFO L129 PetriNetUnfolder]: 4/111 cut-off events. [2021-06-10 12:15:42,091 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-10 12:15:42,091 INFO L84 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 111 events. 4/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 183 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 99. Up to 8 conditions per place. [2021-06-10 12:15:42,092 INFO L132 encePairwiseOnDemand]: 78/84 looper letters, 6 selfloop transitions, 2 changer transitions 21/90 dead transitions. [2021-06-10 12:15:42,092 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 90 transitions, 230 flow [2021-06-10 12:15:42,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-10 12:15:42,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-10 12:15:42,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 671 transitions. [2021-06-10 12:15:42,103 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8875661375661376 [2021-06-10 12:15:42,103 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 671 transitions. [2021-06-10 12:15:42,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 671 transitions. [2021-06-10 12:15:42,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:15:42,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 671 transitions. [2021-06-10 12:15:42,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 74.55555555555556) internal successors, (671), 9 states have internal predecessors, (671), 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:15:42,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 84.0) internal successors, (840), 10 states have internal predecessors, (840), 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:15:42,109 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 84.0) internal successors, (840), 10 states have internal predecessors, (840), 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:15:42,109 INFO L185 Difference]: Start difference. First operand has 85 places, 78 transitions, 164 flow. Second operand 9 states and 671 transitions. [2021-06-10 12:15:42,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 90 transitions, 230 flow [2021-06-10 12:15:42,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 90 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-10 12:15:42,111 INFO L241 Difference]: Finished difference. Result has 98 places, 69 transitions, 162 flow [2021-06-10 12:15:42,111 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=162, PETRI_PLACES=98, PETRI_TRANSITIONS=69} [2021-06-10 12:15:42,111 INFO L343 CegarLoopForPetriNet]: 87 programPoint places, 11 predicate places. [2021-06-10 12:15:42,111 INFO L480 AbstractCegarLoop]: Abstraction has has 98 places, 69 transitions, 162 flow [2021-06-10 12:15:42,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 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:15:42,112 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:15:42,112 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] [2021-06-10 12:15:42,112 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-10 12:15:42,112 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:15:42,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:15:42,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1612378818, now seen corresponding path program 1 times [2021-06-10 12:15:42,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:15:42,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037161308] [2021-06-10 12:15:42,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:15:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:15:42,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:42,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:15:42,272 INFO L142 QuantifierPusher]: treesize reduction 5, result has 37.5 percent of original size [2021-06-10 12:15:42,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:15:42,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:42,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-10 12:15:42,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:42,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-10 12:15:42,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:42,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-10 12:15:42,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:42,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-10 12:15:42,359 INFO L142 QuantifierPusher]: treesize reduction 21, result has 67.7 percent of original size [2021-06-10 12:15:42,363 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-06-10 12:15:42,391 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:15:42,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:15:42,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:42,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:15:42,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:42,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:15:42,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:42,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:15:42,426 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:15:42,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037161308] [2021-06-10 12:15:42,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:15:42,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-10 12:15:42,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973414369] [2021-06-10 12:15:42,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-10 12:15:42,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:15:42,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-10 12:15:42,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-06-10 12:15:42,430 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 84 [2021-06-10 12:15:42,431 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 69 transitions, 162 flow. Second operand has 11 states, 11 states have (on average 63.18181818181818) internal successors, (695), 11 states have internal predecessors, (695), 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:15:42,431 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:15:42,431 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 84 [2021-06-10 12:15:42,431 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:15:42,944 INFO L129 PetriNetUnfolder]: 180/526 cut-off events. [2021-06-10 12:15:42,944 INFO L130 PetriNetUnfolder]: For 152/152 co-relation queries the response was YES. [2021-06-10 12:15:42,947 INFO L84 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 526 events. 180/526 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2952 event pairs, 7 based on Foata normal form. 12/536 useless extension candidates. Maximal degree in co-relation 939. Up to 131 conditions per place. [2021-06-10 12:15:42,949 INFO L132 encePairwiseOnDemand]: 71/84 looper letters, 31 selfloop transitions, 10 changer transitions 56/148 dead transitions. [2021-06-10 12:15:42,950 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 148 transitions, 564 flow [2021-06-10 12:15:42,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-10 12:15:42,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-06-10 12:15:42,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1279 transitions. [2021-06-10 12:15:42,953 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8013784461152882 [2021-06-10 12:15:42,953 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1279 transitions. [2021-06-10 12:15:42,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1279 transitions. [2021-06-10 12:15:42,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:15:42,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1279 transitions. [2021-06-10 12:15:42,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 67.3157894736842) internal successors, (1279), 19 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:15:42,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 84.0) internal successors, (1680), 20 states have internal predecessors, (1680), 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:15:42,963 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 84.0) internal successors, (1680), 20 states have internal predecessors, (1680), 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:15:42,963 INFO L185 Difference]: Start difference. First operand has 98 places, 69 transitions, 162 flow. Second operand 19 states and 1279 transitions. [2021-06-10 12:15:42,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 148 transitions, 564 flow [2021-06-10 12:15:42,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 148 transitions, 504 flow, removed 28 selfloop flow, removed 8 redundant places. [2021-06-10 12:15:42,969 INFO L241 Difference]: Finished difference. Result has 108 places, 75 transitions, 267 flow [2021-06-10 12:15:42,969 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=267, PETRI_PLACES=108, PETRI_TRANSITIONS=75} [2021-06-10 12:15:42,969 INFO L343 CegarLoopForPetriNet]: 87 programPoint places, 21 predicate places. [2021-06-10 12:15:42,969 INFO L480 AbstractCegarLoop]: Abstraction has has 108 places, 75 transitions, 267 flow [2021-06-10 12:15:42,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 63.18181818181818) internal successors, (695), 11 states have internal predecessors, (695), 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:15:42,970 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:15:42,970 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:15:42,970 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-10 12:15:42,970 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:15:42,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:15:42,972 INFO L82 PathProgramCache]: Analyzing trace with hash -192724695, now seen corresponding path program 1 times [2021-06-10 12:15:42,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:15:42,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754142307] [2021-06-10 12:15:42,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:15:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:15:43,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:43,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:15:43,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:43,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:15:43,081 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-10 12:15:43,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-10 12:15:43,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:43,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:15:43,101 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-10 12:15:43,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:15:43,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:43,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:15:43,109 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:15:43,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754142307] [2021-06-10 12:15:43,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:15:43,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-10 12:15:43,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348260420] [2021-06-10 12:15:43,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-10 12:15:43,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:15:43,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-10 12:15:43,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-10 12:15:43,113 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 84 [2021-06-10 12:15:43,114 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 75 transitions, 267 flow. Second operand has 6 states, 6 states have (on average 72.16666666666667) internal successors, (433), 6 states have internal predecessors, (433), 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:15:43,114 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:15:43,114 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 84 [2021-06-10 12:15:43,114 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:15:43,214 INFO L129 PetriNetUnfolder]: 51/239 cut-off events. [2021-06-10 12:15:43,214 INFO L130 PetriNetUnfolder]: For 583/616 co-relation queries the response was YES. [2021-06-10 12:15:43,215 INFO L84 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 239 events. 51/239 cut-off events. For 583/616 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1007 event pairs, 12 based on Foata normal form. 16/244 useless extension candidates. Maximal degree in co-relation 623. Up to 49 conditions per place. [2021-06-10 12:15:43,216 INFO L132 encePairwiseOnDemand]: 76/84 looper letters, 11 selfloop transitions, 11 changer transitions 6/92 dead transitions. [2021-06-10 12:15:43,216 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 92 transitions, 417 flow [2021-06-10 12:15:43,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-10 12:15:43,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-10 12:15:43,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 669 transitions. [2021-06-10 12:15:43,218 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8849206349206349 [2021-06-10 12:15:43,218 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 669 transitions. [2021-06-10 12:15:43,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 669 transitions. [2021-06-10 12:15:43,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:15:43,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 669 transitions. [2021-06-10 12:15:43,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 74.33333333333333) internal successors, (669), 9 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-10 12:15:43,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 84.0) internal successors, (840), 10 states have internal predecessors, (840), 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:15:43,220 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 84.0) internal successors, (840), 10 states have internal predecessors, (840), 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:15:43,220 INFO L185 Difference]: Start difference. First operand has 108 places, 75 transitions, 267 flow. Second operand 9 states and 669 transitions. [2021-06-10 12:15:43,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 92 transitions, 417 flow [2021-06-10 12:15:43,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 92 transitions, 400 flow, removed 3 selfloop flow, removed 6 redundant places. [2021-06-10 12:15:43,229 INFO L241 Difference]: Finished difference. Result has 101 places, 82 transitions, 312 flow [2021-06-10 12:15:43,229 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=312, PETRI_PLACES=101, PETRI_TRANSITIONS=82} [2021-06-10 12:15:43,229 INFO L343 CegarLoopForPetriNet]: 87 programPoint places, 14 predicate places. [2021-06-10 12:15:43,229 INFO L480 AbstractCegarLoop]: Abstraction has has 101 places, 82 transitions, 312 flow [2021-06-10 12:15:43,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 72.16666666666667) internal successors, (433), 6 states have internal predecessors, (433), 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:15:43,230 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:15:43,230 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] [2021-06-10 12:15:43,230 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-10 12:15:43,230 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:15:43,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:15:43,230 INFO L82 PathProgramCache]: Analyzing trace with hash -321716753, now seen corresponding path program 1 times [2021-06-10 12:15:43,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:15:43,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568271466] [2021-06-10 12:15:43,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:15:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:15:43,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:43,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:15:43,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:43,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:15:43,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:43,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:15:43,331 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-10 12:15:43,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-10 12:15:43,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:43,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-10 12:15:43,351 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-10 12:15:43,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:15:43,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:43,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:15:43,358 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:15:43,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568271466] [2021-06-10 12:15:43,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:15:43,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-10 12:15:43,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426158668] [2021-06-10 12:15:43,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-10 12:15:43,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:15:43,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-10 12:15:43,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-10 12:15:43,360 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 84 [2021-06-10 12:15:43,360 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 82 transitions, 312 flow. Second operand has 7 states, 7 states have (on average 72.14285714285714) internal successors, (505), 7 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:15:43,360 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:15:43,360 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 84 [2021-06-10 12:15:43,360 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:15:43,481 INFO L129 PetriNetUnfolder]: 26/192 cut-off events. [2021-06-10 12:15:43,482 INFO L130 PetriNetUnfolder]: For 320/405 co-relation queries the response was YES. [2021-06-10 12:15:43,482 INFO L84 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 192 events. 26/192 cut-off events. For 320/405 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 780 event pairs, 0 based on Foata normal form. 36/217 useless extension candidates. Maximal degree in co-relation 424. Up to 37 conditions per place. [2021-06-10 12:15:43,483 INFO L132 encePairwiseOnDemand]: 76/84 looper letters, 8 selfloop transitions, 15 changer transitions 9/96 dead transitions. [2021-06-10 12:15:43,483 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 96 transitions, 453 flow [2021-06-10 12:15:43,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-10 12:15:43,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-06-10 12:15:43,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 882 transitions. [2021-06-10 12:15:43,485 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.875 [2021-06-10 12:15:43,485 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 882 transitions. [2021-06-10 12:15:43,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 882 transitions. [2021-06-10 12:15:43,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:15:43,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 882 transitions. [2021-06-10 12:15:43,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 73.5) internal successors, (882), 12 states have internal predecessors, (882), 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:15:43,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 84.0) internal successors, (1092), 13 states have internal predecessors, (1092), 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:15:43,488 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 84.0) internal successors, (1092), 13 states have internal predecessors, (1092), 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:15:43,488 INFO L185 Difference]: Start difference. First operand has 101 places, 82 transitions, 312 flow. Second operand 12 states and 882 transitions. [2021-06-10 12:15:43,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 96 transitions, 453 flow [2021-06-10 12:15:43,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 96 transitions, 365 flow, removed 42 selfloop flow, removed 11 redundant places. [2021-06-10 12:15:43,491 INFO L241 Difference]: Finished difference. Result has 107 places, 85 transitions, 322 flow [2021-06-10 12:15:43,491 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=322, PETRI_PLACES=107, PETRI_TRANSITIONS=85} [2021-06-10 12:15:43,491 INFO L343 CegarLoopForPetriNet]: 87 programPoint places, 20 predicate places. [2021-06-10 12:15:43,491 INFO L480 AbstractCegarLoop]: Abstraction has has 107 places, 85 transitions, 322 flow [2021-06-10 12:15:43,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 72.14285714285714) internal successors, (505), 7 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:15:43,492 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:15:43,492 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:15:43,492 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-10 12:15:43,492 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:15:43,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:15:43,492 INFO L82 PathProgramCache]: Analyzing trace with hash 305434159, now seen corresponding path program 1 times [2021-06-10 12:15:43,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:15:43,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11547200] [2021-06-10 12:15:43,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:15:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-10 12:15:43,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:43,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:15:43,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:43,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:15:43,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:43,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-10 12:15:43,586 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-10 12:15:43,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-10 12:15:43,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:43,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:15:43,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:43,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-10 12:15:43,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-10 12:15:43,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-10 12:15:43,611 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:15:43,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11547200] [2021-06-10 12:15:43,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-10 12:15:43,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-10 12:15:43,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568152882] [2021-06-10 12:15:43,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-10 12:15:43,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-10 12:15:43,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-10 12:15:43,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-06-10 12:15:43,613 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 84 [2021-06-10 12:15:43,613 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 85 transitions, 322 flow. Second operand has 7 states, 7 states have (on average 71.42857142857143) internal successors, (500), 7 states have internal predecessors, (500), 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:15:43,614 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-10 12:15:43,614 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 84 [2021-06-10 12:15:43,614 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-10 12:15:43,684 INFO L129 PetriNetUnfolder]: 22/248 cut-off events. [2021-06-10 12:15:43,685 INFO L130 PetriNetUnfolder]: For 296/309 co-relation queries the response was YES. [2021-06-10 12:15:43,685 INFO L84 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 248 events. 22/248 cut-off events. For 296/309 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1368 event pairs, 0 based on Foata normal form. 1/240 useless extension candidates. Maximal degree in co-relation 554. Up to 42 conditions per place. [2021-06-10 12:15:43,686 INFO L132 encePairwiseOnDemand]: 78/84 looper letters, 9 selfloop transitions, 1 changer transitions 5/90 dead transitions. [2021-06-10 12:15:43,686 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 90 transitions, 362 flow [2021-06-10 12:15:43,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-10 12:15:43,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-10 12:15:43,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 506 transitions. [2021-06-10 12:15:43,687 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8605442176870748 [2021-06-10 12:15:43,688 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 506 transitions. [2021-06-10 12:15:43,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 506 transitions. [2021-06-10 12:15:43,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-10 12:15:43,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 506 transitions. [2021-06-10 12:15:43,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 72.28571428571429) internal successors, (506), 7 states have internal predecessors, (506), 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:15:43,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 84.0) internal successors, (672), 8 states have internal predecessors, (672), 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:15:43,690 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 84.0) internal successors, (672), 8 states have internal predecessors, (672), 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:15:43,690 INFO L185 Difference]: Start difference. First operand has 107 places, 85 transitions, 322 flow. Second operand 7 states and 506 transitions. [2021-06-10 12:15:43,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 90 transitions, 362 flow [2021-06-10 12:15:43,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 90 transitions, 328 flow, removed 5 selfloop flow, removed 9 redundant places. [2021-06-10 12:15:43,694 INFO L241 Difference]: Finished difference. Result has 107 places, 85 transitions, 301 flow [2021-06-10 12:15:43,694 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=301, PETRI_PLACES=107, PETRI_TRANSITIONS=85} [2021-06-10 12:15:43,694 INFO L343 CegarLoopForPetriNet]: 87 programPoint places, 20 predicate places. [2021-06-10 12:15:43,694 INFO L480 AbstractCegarLoop]: Abstraction has has 107 places, 85 transitions, 301 flow [2021-06-10 12:15:43,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 71.42857142857143) internal successors, (500), 7 states have internal predecessors, (500), 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:15:43,695 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-10 12:15:43,695 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:15:43,695 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-10 12:15:43,695 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-10 12:15:43,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-10 12:15:43,695 INFO L82 PathProgramCache]: Analyzing trace with hash -846842549, now seen corresponding path program 2 times [2021-06-10 12:15:43,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-10 12:15:43,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341686724] [2021-06-10 12:15:43,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-10 12:15:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 12:15:43,733 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 12:15:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-10 12:15:43,767 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-10 12:15:43,799 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-10 12:15:43,799 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-10 12:15:43,799 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-10 12:15:43,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.06 12:15:43 BasicIcfg [2021-06-10 12:15:43,886 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-10 12:15:43,887 INFO L168 Benchmark]: Toolchain (without parser) took 4333.56 ms. Allocated memory was 381.7 MB in the beginning and 465.6 MB in the end (delta: 83.9 MB). Free memory was 344.3 MB in the beginning and 350.9 MB in the end (delta: -6.6 MB). Peak memory consumption was 77.5 MB. Max. memory is 16.0 GB. [2021-06-10 12:15:43,887 INFO L168 Benchmark]: CDTParser took 0.64 ms. Allocated memory is still 381.7 MB. Free memory was 362.6 MB in the beginning and 362.5 MB in the end (delta: 77.8 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-10 12:15:43,887 INFO L168 Benchmark]: CACSL2BoogieTranslator took 492.48 ms. Allocated memory is still 381.7 MB. Free memory was 344.2 MB in the beginning and 342.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.0 GB. [2021-06-10 12:15:43,888 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.24 ms. Allocated memory is still 381.7 MB. Free memory was 342.2 MB in the beginning and 339.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-10 12:15:43,888 INFO L168 Benchmark]: Boogie Preprocessor took 19.94 ms. Allocated memory is still 381.7 MB. Free memory was 339.6 MB in the beginning and 337.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-10 12:15:43,888 INFO L168 Benchmark]: RCFGBuilder took 1239.16 ms. Allocated memory is still 381.7 MB. Free memory was 337.0 MB in the beginning and 295.0 MB in the end (delta: 42.0 MB). Peak memory consumption was 141.6 MB. Max. memory is 16.0 GB. [2021-06-10 12:15:43,889 INFO L168 Benchmark]: TraceAbstraction took 2500.73 ms. Allocated memory was 381.7 MB in the beginning and 465.6 MB in the end (delta: 83.9 MB). Free memory was 294.0 MB in the beginning and 350.9 MB in the end (delta: -56.9 MB). Peak memory consumption was 27.0 MB. Max. memory is 16.0 GB. [2021-06-10 12:15:43,890 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.64 ms. Allocated memory is still 381.7 MB. Free memory was 362.6 MB in the beginning and 362.5 MB in the end (delta: 77.8 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 492.48 ms. Allocated memory is still 381.7 MB. Free memory was 344.2 MB in the beginning and 342.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 67.24 ms. Allocated memory is still 381.7 MB. Free memory was 342.2 MB in the beginning and 339.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 19.94 ms. Allocated memory is still 381.7 MB. Free memory was 339.6 MB in the beginning and 337.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1239.16 ms. Allocated memory is still 381.7 MB. Free memory was 337.0 MB in the beginning and 295.0 MB in the end (delta: 42.0 MB). Peak memory consumption was 141.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 2500.73 ms. Allocated memory was 381.7 MB in the beginning and 465.6 MB in the end (delta: 83.9 MB). Free memory was 294.0 MB in the beginning and 350.9 MB in the end (delta: -56.9 MB). Peak memory consumption was 27.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L712] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L713] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L714] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L716] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L718] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L719] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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] [L720] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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] [L721] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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] [L722] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0] [L723] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0] [L724] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L725] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L726] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L727] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L728] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L729] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L730] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L732] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L734] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L735] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L736] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] 0 pthread_t t1099; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L803] FCALL, FORK 0 pthread_create(&t1099, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] 0 pthread_t t1100; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L805] FCALL, FORK 0 pthread_create(&t1100, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 2 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L740] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L746] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L746] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L747] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L748] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L749] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L750] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L780] 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) [L780] 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) [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 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 [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 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 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 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) [L811] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L811] 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) [L811] 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) [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L812] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L813] 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 [L814] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L814] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L815] 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 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 x$flush_delayed = weak$$choice2 [L821] 0 x$mem_tmp = x [L822] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L822] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L823] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L823] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L824] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L824] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L825] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L825] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L826] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L827] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L828] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L830] 0 x = x$flush_delayed ? x$mem_tmp : x [L831] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 83 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 6.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 2335.9ms, OverallIterations: 7, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1114.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 32.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 42 SDtfs, 157 SDslu, 144 SDs, 0 SdLazy, 266 SolverSat, 71 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 243.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 666.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=322occurred in iteration=5, InterpolantAutomatonStates: 59, 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: 24.0ms SsaConstructionTime, 309.0ms SatisfiabilityAnalysisTime, 661.1ms InterpolantComputationTime, 401 NumberOfCodeBlocks, 401 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 330 ConstructedInterpolants, 0 QuantifiedInterpolants, 1203 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...