/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/mix008_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 02:11:27,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 02:11:27,845 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 02:11:27,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 02:11:27,876 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 02:11:27,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 02:11:27,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 02:11:27,889 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 02:11:27,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 02:11:27,896 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 02:11:27,897 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 02:11:27,898 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 02:11:27,898 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 02:11:27,899 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 02:11:27,900 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 02:11:27,900 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 02:11:27,901 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 02:11:27,901 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 02:11:27,903 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 02:11:27,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 02:11:27,905 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 02:11:27,908 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 02:11:27,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 02:11:27,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 02:11:27,921 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 02:11:27,921 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 02:11:27,922 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 02:11:27,922 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 02:11:27,923 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 02:11:27,923 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 02:11:27,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 02:11:27,924 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 02:11:27,925 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 02:11:27,925 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 02:11:27,926 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 02:11:27,926 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 02:11:27,927 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 02:11:27,927 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 02:11:27,927 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 02:11:27,928 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 02:11:27,928 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 02:11:27,934 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-03-11 02:11:27,969 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 02:11:27,969 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 02:11:27,970 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 02:11:27,970 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 02:11:27,970 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 02:11:27,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 02:11:27,970 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 02:11:27,971 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 02:11:27,971 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 02:11:27,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 02:11:27,971 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 02:11:27,971 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 02:11:27,971 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 02:11:27,971 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 02:11:27,971 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 02:11:27,971 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 02:11:27,972 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 02:11:27,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 02:11:27,972 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 02:11:27,972 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 02:11:27,972 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 02:11:27,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 02:11:27,972 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 02:11:27,973 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 02:11:27,973 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 02:11:27,973 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 02:11:27,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 02:11:27,973 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-03-11 02:11:27,973 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 02:11:27,973 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-11 02:11:28,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 02:11:28,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 02:11:28,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 02:11:28,288 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 02:11:28,288 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 02:11:28,289 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008_power.oepc.i [2021-03-11 02:11:28,344 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8ea8c7fe/7e1cc92d4bf54f5faf3cfb8a3a707f96/FLAG7b4b86659 [2021-03-11 02:11:28,823 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 02:11:28,824 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_power.oepc.i [2021-03-11 02:11:28,842 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8ea8c7fe/7e1cc92d4bf54f5faf3cfb8a3a707f96/FLAG7b4b86659 [2021-03-11 02:11:28,857 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8ea8c7fe/7e1cc92d4bf54f5faf3cfb8a3a707f96 [2021-03-11 02:11:28,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 02:11:28,864 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 02:11:28,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 02:11:28,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 02:11:28,868 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 02:11:28,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 02:11:28" (1/1) ... [2021-03-11 02:11:28,870 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e0a7e08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:11:28, skipping insertion in model container [2021-03-11 02:11:28,870 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 02:11:28" (1/1) ... [2021-03-11 02:11:28,875 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 02:11:28,918 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 02:11:29,065 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/mix008_power.oepc.i[951,964] [2021-03-11 02:11:29,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 02:11:29,294 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 02:11:29,304 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/mix008_power.oepc.i[951,964] [2021-03-11 02:11:29,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 02:11:29,437 INFO L208 MainTranslator]: Completed translation [2021-03-11 02:11:29,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:11:29 WrapperNode [2021-03-11 02:11:29,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 02:11:29,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 02:11:29,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 02:11:29,440 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 02:11:29,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:11:29" (1/1) ... [2021-03-11 02:11:29,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:11:29" (1/1) ... [2021-03-11 02:11:29,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 02:11:29,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 02:11:29,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 02:11:29,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 02:11:29,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:11:29" (1/1) ... [2021-03-11 02:11:29,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:11:29" (1/1) ... [2021-03-11 02:11:29,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:11:29" (1/1) ... [2021-03-11 02:11:29,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:11:29" (1/1) ... [2021-03-11 02:11:29,544 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:11:29" (1/1) ... [2021-03-11 02:11:29,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:11:29" (1/1) ... [2021-03-11 02:11:29,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:11:29" (1/1) ... [2021-03-11 02:11:29,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 02:11:29,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 02:11:29,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 02:11:29,571 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 02:11:29,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:11:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 02:11:29,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 02:11:29,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 02:11:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 02:11:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 02:11:29,640 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 02:11:29,641 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 02:11:29,641 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 02:11:29,642 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 02:11:29,642 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 02:11:29,642 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 02:11:29,642 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-11 02:11:29,642 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-11 02:11:29,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 02:11:29,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 02:11:29,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 02:11:29,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 02:11:29,644 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 02:11:31,362 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 02:11:31,362 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 02:11:31,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 02:11:31 BoogieIcfgContainer [2021-03-11 02:11:31,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 02:11:31,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 02:11:31,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 02:11:31,367 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 02:11:31,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 02:11:28" (1/3) ... [2021-03-11 02:11:31,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3385d4bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 02:11:31, skipping insertion in model container [2021-03-11 02:11:31,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 02:11:29" (2/3) ... [2021-03-11 02:11:31,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3385d4bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 02:11:31, skipping insertion in model container [2021-03-11 02:11:31,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 02:11:31" (3/3) ... [2021-03-11 02:11:31,369 INFO L111 eAbstractionObserver]: Analyzing ICFG mix008_power.oepc.i [2021-03-11 02:11:31,375 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 02:11:31,378 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 02:11:31,378 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 02:11:31,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,411 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,411 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,412 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,412 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,412 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,412 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,412 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,413 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,416 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,416 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,416 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,416 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,417 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,419 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,419 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,419 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,420 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,420 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,420 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,423 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,423 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,423 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,423 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,423 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,423 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,423 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,423 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,424 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,425 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,425 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,425 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,425 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,425 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,425 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,425 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,425 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,425 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,425 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,426 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,427 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,427 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,427 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,427 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,427 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,427 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,427 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,432 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,432 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,432 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,432 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,432 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,432 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,434 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,434 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,434 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,434 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,434 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,434 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,434 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,435 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,435 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,435 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,435 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,435 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,435 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,435 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,436 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,436 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,436 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,436 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,437 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,438 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,438 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,438 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,438 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,438 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,438 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,438 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,438 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,438 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,439 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,439 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,439 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,439 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,439 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,439 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,439 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,439 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,439 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,440 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,441 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,441 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,441 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,441 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,442 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,443 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,444 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,444 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,445 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,445 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,445 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,445 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,445 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,445 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,445 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,446 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,446 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,446 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,447 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,447 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 02:11:31,449 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 02:11:31,463 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-11 02:11:31,479 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 02:11:31,479 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 02:11:31,479 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 02:11:31,480 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 02:11:31,480 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 02:11:31,480 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 02:11:31,480 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 02:11:31,480 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 02:11:31,488 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 130 places, 119 transitions, 258 flow [2021-03-11 02:11:31,521 INFO L129 PetriNetUnfolder]: 2/115 cut-off events. [2021-03-11 02:11:31,521 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 02:11:31,533 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 92 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-11 02:11:31,533 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 119 transitions, 258 flow [2021-03-11 02:11:31,537 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 115 transitions, 242 flow [2021-03-11 02:11:31,543 INFO L129 PetriNetUnfolder]: 0/45 cut-off events. [2021-03-11 02:11:31,543 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 02:11:31,543 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:11:31,544 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:11:31,544 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:11:31,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:11:31,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1971298699, now seen corresponding path program 1 times [2021-03-11 02:11:31,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:11:31,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881949] [2021-03-11 02:11:31,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:11:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:11:31,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:31,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:11:31,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:31,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:11:31,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:11:31,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881949] [2021-03-11 02:11:31,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:11:31,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 02:11:31,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213941264] [2021-03-11 02:11:31,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 02:11:31,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:11:31,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 02:11:31,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 02:11:31,805 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 119 [2021-03-11 02:11:31,808 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 115 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:31,808 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:11:31,808 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 119 [2021-03-11 02:11:31,809 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:11:31,971 INFO L129 PetriNetUnfolder]: 133/476 cut-off events. [2021-03-11 02:11:31,972 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 02:11:31,977 INFO L84 FinitePrefix]: Finished finitePrefix Result has 695 conditions, 476 events. 133/476 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2660 event pairs, 110 based on Foata normal form. 52/503 useless extension candidates. Maximal degree in co-relation 643. Up to 153 conditions per place. [2021-03-11 02:11:31,981 INFO L132 encePairwiseOnDemand]: 114/119 looper letters, 11 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2021-03-11 02:11:31,982 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 116 transitions, 270 flow [2021-03-11 02:11:31,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 02:11:31,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 02:11:31,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2021-03-11 02:11:31,997 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9495798319327731 [2021-03-11 02:11:31,998 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2021-03-11 02:11:31,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2021-03-11 02:11:32,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:11:32,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2021-03-11 02:11:32,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:32,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:32,010 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:32,012 INFO L185 Difference]: Start difference. First operand has 126 places, 115 transitions, 242 flow. Second operand 3 states and 339 transitions. [2021-03-11 02:11:32,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 116 transitions, 270 flow [2021-03-11 02:11:32,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 116 transitions, 266 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-11 02:11:32,019 INFO L241 Difference]: Finished difference. Result has 122 places, 111 transitions, 234 flow [2021-03-11 02:11:32,021 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=122, PETRI_TRANSITIONS=111} [2021-03-11 02:11:32,064 INFO L335 CegarLoopForPetriNet]: 126 programPoint places, -4 predicate places. [2021-03-11 02:11:32,064 INFO L480 AbstractCegarLoop]: Abstraction has has 122 places, 111 transitions, 234 flow [2021-03-11 02:11:32,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:32,065 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:11:32,065 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:11:32,065 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 02:11:32,066 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:11:32,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:11:32,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1661310527, now seen corresponding path program 1 times [2021-03-11 02:11:32,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:11:32,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566413847] [2021-03-11 02:11:32,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:11:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:11:32,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:32,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:11:32,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:32,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:11:32,207 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-11 02:11:32,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-11 02:11:32,226 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:11:32,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:11:32,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:32,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:11:32,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:32,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:11:32,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:32,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:11:32,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:11:32,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566413847] [2021-03-11 02:11:32,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:11:32,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 02:11:32,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143784543] [2021-03-11 02:11:32,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 02:11:32,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:11:32,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 02:11:32,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-11 02:11:32,271 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 119 [2021-03-11 02:11:32,272 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 111 transitions, 234 flow. Second operand has 7 states, 7 states have (on average 96.71428571428571) internal successors, (677), 7 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:32,272 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:11:32,273 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 119 [2021-03-11 02:11:32,273 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:11:33,400 INFO L129 PetriNetUnfolder]: 2017/5397 cut-off events. [2021-03-11 02:11:33,400 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 02:11:33,418 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8369 conditions, 5397 events. 2017/5397 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 50684 event pairs, 313 based on Foata normal form. 0/5273 useless extension candidates. Maximal degree in co-relation 8313. Up to 851 conditions per place. [2021-03-11 02:11:33,433 INFO L132 encePairwiseOnDemand]: 107/119 looper letters, 27 selfloop transitions, 8 changer transitions 84/198 dead transitions. [2021-03-11 02:11:33,433 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 198 transitions, 624 flow [2021-03-11 02:11:33,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-11 02:11:33,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-03-11 02:11:33,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1346 transitions. [2021-03-11 02:11:33,438 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.870071105365223 [2021-03-11 02:11:33,438 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1346 transitions. [2021-03-11 02:11:33,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1346 transitions. [2021-03-11 02:11:33,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:11:33,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1346 transitions. [2021-03-11 02:11:33,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 103.53846153846153) internal successors, (1346), 13 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:33,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:33,448 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:33,448 INFO L185 Difference]: Start difference. First operand has 122 places, 111 transitions, 234 flow. Second operand 13 states and 1346 transitions. [2021-03-11 02:11:33,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 198 transitions, 624 flow [2021-03-11 02:11:33,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 198 transitions, 620 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 02:11:33,454 INFO L241 Difference]: Finished difference. Result has 144 places, 105 transitions, 320 flow [2021-03-11 02:11:33,454 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=320, PETRI_PLACES=144, PETRI_TRANSITIONS=105} [2021-03-11 02:11:33,455 INFO L335 CegarLoopForPetriNet]: 126 programPoint places, 18 predicate places. [2021-03-11 02:11:33,455 INFO L480 AbstractCegarLoop]: Abstraction has has 144 places, 105 transitions, 320 flow [2021-03-11 02:11:33,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 96.71428571428571) internal successors, (677), 7 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:33,456 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:11:33,456 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:11:33,456 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 02:11:33,456 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:11:33,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:11:33,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1431542871, now seen corresponding path program 1 times [2021-03-11 02:11:33,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:11:33,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053891882] [2021-03-11 02:11:33,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:11:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:11:33,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:33,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:11:33,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:33,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:11:33,605 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-11 02:11:33,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-11 02:11:33,621 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:11:33,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:11:33,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:33,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:11:33,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:33,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:11:33,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:33,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:11:33,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:11:33,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053891882] [2021-03-11 02:11:33,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:11:33,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 02:11:33,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539240490] [2021-03-11 02:11:33,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 02:11:33,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:11:33,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 02:11:33,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-11 02:11:33,663 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 119 [2021-03-11 02:11:33,664 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 105 transitions, 320 flow. Second operand has 7 states, 7 states have (on average 97.0) internal successors, (679), 7 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:33,664 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:11:33,664 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 119 [2021-03-11 02:11:33,664 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:11:34,320 INFO L129 PetriNetUnfolder]: 1075/2566 cut-off events. [2021-03-11 02:11:34,320 INFO L130 PetriNetUnfolder]: For 6540/8606 co-relation queries the response was YES. [2021-03-11 02:11:34,331 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8892 conditions, 2566 events. 1075/2566 cut-off events. For 6540/8606 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 19478 event pairs, 66 based on Foata normal form. 60/2592 useless extension candidates. Maximal degree in co-relation 8824. Up to 813 conditions per place. [2021-03-11 02:11:34,345 INFO L132 encePairwiseOnDemand]: 102/119 looper letters, 24 selfloop transitions, 21 changer transitions 61/185 dead transitions. [2021-03-11 02:11:34,345 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 185 transitions, 1166 flow [2021-03-11 02:11:34,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-11 02:11:34,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-03-11 02:11:34,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1338 transitions. [2021-03-11 02:11:34,349 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8648998060762767 [2021-03-11 02:11:34,349 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1338 transitions. [2021-03-11 02:11:34,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1338 transitions. [2021-03-11 02:11:34,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:11:34,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1338 transitions. [2021-03-11 02:11:34,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 102.92307692307692) internal successors, (1338), 13 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:34,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:34,357 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:34,357 INFO L185 Difference]: Start difference. First operand has 144 places, 105 transitions, 320 flow. Second operand 13 states and 1338 transitions. [2021-03-11 02:11:34,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 185 transitions, 1166 flow [2021-03-11 02:11:34,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 185 transitions, 1138 flow, removed 12 selfloop flow, removed 4 redundant places. [2021-03-11 02:11:34,376 INFO L241 Difference]: Finished difference. Result has 143 places, 115 transitions, 513 flow [2021-03-11 02:11:34,376 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=513, PETRI_PLACES=143, PETRI_TRANSITIONS=115} [2021-03-11 02:11:34,376 INFO L335 CegarLoopForPetriNet]: 126 programPoint places, 17 predicate places. [2021-03-11 02:11:34,376 INFO L480 AbstractCegarLoop]: Abstraction has has 143 places, 115 transitions, 513 flow [2021-03-11 02:11:34,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 97.0) internal successors, (679), 7 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:34,377 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:11:34,377 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:11:34,377 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 02:11:34,377 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:11:34,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:11:34,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1090069276, now seen corresponding path program 1 times [2021-03-11 02:11:34,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:11:34,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96768539] [2021-03-11 02:11:34,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:11:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:11:34,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:34,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:11:34,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:34,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:11:34,481 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:11:34,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:11:34,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:34,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:11:34,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:34,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:11:34,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:34,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:11:34,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:11:34,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96768539] [2021-03-11 02:11:34,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:11:34,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 02:11:34,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384053361] [2021-03-11 02:11:34,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 02:11:34,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:11:34,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 02:11:34,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-11 02:11:34,512 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 119 [2021-03-11 02:11:34,513 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 115 transitions, 513 flow. Second operand has 6 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:34,513 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:11:34,513 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 119 [2021-03-11 02:11:34,513 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:11:34,866 INFO L129 PetriNetUnfolder]: 518/1563 cut-off events. [2021-03-11 02:11:34,866 INFO L130 PetriNetUnfolder]: For 8092/9048 co-relation queries the response was YES. [2021-03-11 02:11:34,877 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5789 conditions, 1563 events. 518/1563 cut-off events. For 8092/9048 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11619 event pairs, 181 based on Foata normal form. 174/1686 useless extension candidates. Maximal degree in co-relation 5708. Up to 474 conditions per place. [2021-03-11 02:11:34,886 INFO L132 encePairwiseOnDemand]: 113/119 looper letters, 6 selfloop transitions, 4 changer transitions 13/128 dead transitions. [2021-03-11 02:11:34,887 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 128 transitions, 685 flow [2021-03-11 02:11:34,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 02:11:34,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 02:11:34,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 983 transitions. [2021-03-11 02:11:34,890 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9178338001867413 [2021-03-11 02:11:34,890 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 983 transitions. [2021-03-11 02:11:34,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 983 transitions. [2021-03-11 02:11:34,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:11:34,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 983 transitions. [2021-03-11 02:11:34,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 109.22222222222223) internal successors, (983), 9 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:34,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:34,896 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:34,896 INFO L185 Difference]: Start difference. First operand has 143 places, 115 transitions, 513 flow. Second operand 9 states and 983 transitions. [2021-03-11 02:11:34,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 128 transitions, 685 flow [2021-03-11 02:11:34,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 128 transitions, 637 flow, removed 24 selfloop flow, removed 9 redundant places. [2021-03-11 02:11:34,913 INFO L241 Difference]: Finished difference. Result has 140 places, 115 transitions, 515 flow [2021-03-11 02:11:34,913 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=515, PETRI_PLACES=140, PETRI_TRANSITIONS=115} [2021-03-11 02:11:34,913 INFO L335 CegarLoopForPetriNet]: 126 programPoint places, 14 predicate places. [2021-03-11 02:11:34,913 INFO L480 AbstractCegarLoop]: Abstraction has has 140 places, 115 transitions, 515 flow [2021-03-11 02:11:34,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:34,914 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:11:34,914 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:11:34,914 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 02:11:34,914 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:11:34,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:11:34,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1320744416, now seen corresponding path program 1 times [2021-03-11 02:11:34,915 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:11:34,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900688997] [2021-03-11 02:11:34,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:11:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:11:35,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:35,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:11:35,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:35,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:11:35,012 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-03-11 02:11:35,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-11 02:11:35,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:35,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 02:11:35,038 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 02:11:35,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:11:35,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:35,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:11:35,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:11:35,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900688997] [2021-03-11 02:11:35,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:11:35,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 02:11:35,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023081324] [2021-03-11 02:11:35,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 02:11:35,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:11:35,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 02:11:35,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-11 02:11:35,051 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 119 [2021-03-11 02:11:35,051 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 115 transitions, 515 flow. Second operand has 6 states, 6 states have (on average 105.16666666666667) internal successors, (631), 6 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:35,051 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:11:35,051 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 119 [2021-03-11 02:11:35,052 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:11:36,228 INFO L129 PetriNetUnfolder]: 3367/8023 cut-off events. [2021-03-11 02:11:36,228 INFO L130 PetriNetUnfolder]: For 6809/7496 co-relation queries the response was YES. [2021-03-11 02:11:36,282 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17157 conditions, 8023 events. 3367/8023 cut-off events. For 6809/7496 co-relation queries the response was YES. Maximal size of possible extension queue 1114. Compared 85923 event pairs, 638 based on Foata normal form. 145/7241 useless extension candidates. Maximal degree in co-relation 17076. Up to 2149 conditions per place. [2021-03-11 02:11:36,332 INFO L132 encePairwiseOnDemand]: 108/119 looper letters, 29 selfloop transitions, 20 changer transitions 0/152 dead transitions. [2021-03-11 02:11:36,333 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 152 transitions, 687 flow [2021-03-11 02:11:36,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-11 02:11:36,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-11 02:11:36,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1091 transitions. [2021-03-11 02:11:36,337 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9168067226890756 [2021-03-11 02:11:36,337 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1091 transitions. [2021-03-11 02:11:36,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1091 transitions. [2021-03-11 02:11:36,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:11:36,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1091 transitions. [2021-03-11 02:11:36,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 109.1) internal successors, (1091), 10 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:36,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 119.0) internal successors, (1309), 11 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:36,343 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 119.0) internal successors, (1309), 11 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:36,343 INFO L185 Difference]: Start difference. First operand has 140 places, 115 transitions, 515 flow. Second operand 10 states and 1091 transitions. [2021-03-11 02:11:36,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 152 transitions, 687 flow [2021-03-11 02:11:36,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 152 transitions, 667 flow, removed 6 selfloop flow, removed 8 redundant places. [2021-03-11 02:11:36,362 INFO L241 Difference]: Finished difference. Result has 141 places, 133 transitions, 638 flow [2021-03-11 02:11:36,362 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=638, PETRI_PLACES=141, PETRI_TRANSITIONS=133} [2021-03-11 02:11:36,362 INFO L335 CegarLoopForPetriNet]: 126 programPoint places, 15 predicate places. [2021-03-11 02:11:36,362 INFO L480 AbstractCegarLoop]: Abstraction has has 141 places, 133 transitions, 638 flow [2021-03-11 02:11:36,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 105.16666666666667) internal successors, (631), 6 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:36,363 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:11:36,363 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:11:36,363 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 02:11:36,363 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:11:36,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:11:36,364 INFO L82 PathProgramCache]: Analyzing trace with hash 516756207, now seen corresponding path program 1 times [2021-03-11 02:11:36,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:11:36,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318611496] [2021-03-11 02:11:36,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:11:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:11:36,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:36,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:11:36,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:36,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:11:36,455 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:11:36,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:11:36,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:36,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:11:36,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:36,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:11:36,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:36,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:11:36,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:11:36,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318611496] [2021-03-11 02:11:36,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:11:36,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 02:11:36,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131746314] [2021-03-11 02:11:36,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 02:11:36,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:11:36,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 02:11:36,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-11 02:11:36,491 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 119 [2021-03-11 02:11:36,492 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 133 transitions, 638 flow. Second operand has 6 states, 6 states have (on average 107.33333333333333) internal successors, (644), 6 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:36,492 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:11:36,492 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 119 [2021-03-11 02:11:36,492 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:11:37,564 INFO L129 PetriNetUnfolder]: 1762/6802 cut-off events. [2021-03-11 02:11:37,565 INFO L130 PetriNetUnfolder]: For 11280/13178 co-relation queries the response was YES. [2021-03-11 02:11:37,624 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18955 conditions, 6802 events. 1762/6802 cut-off events. For 11280/13178 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 82701 event pairs, 660 based on Foata normal form. 354/6606 useless extension candidates. Maximal degree in co-relation 18873. Up to 2019 conditions per place. [2021-03-11 02:11:37,657 INFO L132 encePairwiseOnDemand]: 113/119 looper letters, 14 selfloop transitions, 16 changer transitions 0/147 dead transitions. [2021-03-11 02:11:37,657 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 147 transitions, 792 flow [2021-03-11 02:11:37,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 02:11:37,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 02:11:37,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 980 transitions. [2021-03-11 02:11:37,660 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9150326797385621 [2021-03-11 02:11:37,660 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 980 transitions. [2021-03-11 02:11:37,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 980 transitions. [2021-03-11 02:11:37,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:11:37,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 980 transitions. [2021-03-11 02:11:37,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 108.88888888888889) internal successors, (980), 9 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:37,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:37,667 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:37,667 INFO L185 Difference]: Start difference. First operand has 141 places, 133 transitions, 638 flow. Second operand 9 states and 980 transitions. [2021-03-11 02:11:37,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 147 transitions, 792 flow [2021-03-11 02:11:37,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 147 transitions, 790 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 02:11:37,698 INFO L241 Difference]: Finished difference. Result has 155 places, 141 transitions, 776 flow [2021-03-11 02:11:37,698 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=776, PETRI_PLACES=155, PETRI_TRANSITIONS=141} [2021-03-11 02:11:37,698 INFO L335 CegarLoopForPetriNet]: 126 programPoint places, 29 predicate places. [2021-03-11 02:11:37,698 INFO L480 AbstractCegarLoop]: Abstraction has has 155 places, 141 transitions, 776 flow [2021-03-11 02:11:37,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 107.33333333333333) internal successors, (644), 6 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:37,699 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:11:37,699 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:11:37,699 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 02:11:37,699 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:11:37,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:11:37,700 INFO L82 PathProgramCache]: Analyzing trace with hash 954373977, now seen corresponding path program 1 times [2021-03-11 02:11:37,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:11:37,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774852789] [2021-03-11 02:11:37,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:11:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:11:37,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:37,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:11:37,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:37,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:11:37,778 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-03-11 02:11:37,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-11 02:11:37,792 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:11:37,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:11:37,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:37,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:11:37,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:37,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:11:37,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:37,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:11:37,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:11:37,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774852789] [2021-03-11 02:11:37,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:11:37,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 02:11:37,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164090334] [2021-03-11 02:11:37,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 02:11:37,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:11:37,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 02:11:37,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-11 02:11:37,832 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 119 [2021-03-11 02:11:37,833 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 141 transitions, 776 flow. Second operand has 7 states, 7 states have (on average 97.42857142857143) internal successors, (682), 7 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:37,833 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:11:37,833 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 119 [2021-03-11 02:11:37,833 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:11:39,533 INFO L129 PetriNetUnfolder]: 3160/11471 cut-off events. [2021-03-11 02:11:39,533 INFO L130 PetriNetUnfolder]: For 25505/31511 co-relation queries the response was YES. [2021-03-11 02:11:39,650 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35593 conditions, 11471 events. 3160/11471 cut-off events. For 25505/31511 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 148148 event pairs, 1233 based on Foata normal form. 312/10970 useless extension candidates. Maximal degree in co-relation 35499. Up to 3418 conditions per place. [2021-03-11 02:11:39,707 INFO L132 encePairwiseOnDemand]: 102/119 looper letters, 64 selfloop transitions, 32 changer transitions 0/193 dead transitions. [2021-03-11 02:11:39,707 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 193 transitions, 1498 flow [2021-03-11 02:11:39,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 02:11:39,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 02:11:39,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 721 transitions. [2021-03-11 02:11:39,710 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.865546218487395 [2021-03-11 02:11:39,710 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 721 transitions. [2021-03-11 02:11:39,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 721 transitions. [2021-03-11 02:11:39,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:11:39,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 721 transitions. [2021-03-11 02:11:39,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:39,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:39,714 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:39,714 INFO L185 Difference]: Start difference. First operand has 155 places, 141 transitions, 776 flow. Second operand 7 states and 721 transitions. [2021-03-11 02:11:39,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 193 transitions, 1498 flow [2021-03-11 02:11:39,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 193 transitions, 1460 flow, removed 12 selfloop flow, removed 1 redundant places. [2021-03-11 02:11:39,783 INFO L241 Difference]: Finished difference. Result has 166 places, 161 transitions, 1132 flow [2021-03-11 02:11:39,784 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1132, PETRI_PLACES=166, PETRI_TRANSITIONS=161} [2021-03-11 02:11:39,784 INFO L335 CegarLoopForPetriNet]: 126 programPoint places, 40 predicate places. [2021-03-11 02:11:39,784 INFO L480 AbstractCegarLoop]: Abstraction has has 166 places, 161 transitions, 1132 flow [2021-03-11 02:11:39,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 97.42857142857143) internal successors, (682), 7 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:39,784 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:11:39,784 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:11:39,784 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 02:11:39,785 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:11:39,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:11:39,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1750902029, now seen corresponding path program 2 times [2021-03-11 02:11:39,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:11:39,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765328511] [2021-03-11 02:11:39,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:11:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:11:39,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:39,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:11:39,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:39,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:11:39,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:39,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:11:39,859 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-03-11 02:11:39,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-11 02:11:39,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:39,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 02:11:39,885 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 02:11:39,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:11:39,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:39,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:11:39,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:11:39,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765328511] [2021-03-11 02:11:39,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:11:39,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 02:11:39,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057283858] [2021-03-11 02:11:39,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 02:11:39,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:11:39,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 02:11:39,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-11 02:11:39,899 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 119 [2021-03-11 02:11:39,900 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 161 transitions, 1132 flow. Second operand has 7 states, 7 states have (on average 105.14285714285714) internal successors, (736), 7 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:39,900 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:11:39,900 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 119 [2021-03-11 02:11:39,900 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:11:42,170 INFO L129 PetriNetUnfolder]: 7371/16953 cut-off events. [2021-03-11 02:11:42,170 INFO L130 PetriNetUnfolder]: For 49960/62819 co-relation queries the response was YES. [2021-03-11 02:11:42,378 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62897 conditions, 16953 events. 7371/16953 cut-off events. For 49960/62819 co-relation queries the response was YES. Maximal size of possible extension queue 2253. Compared 201805 event pairs, 249 based on Foata normal form. 2185/17607 useless extension candidates. Maximal degree in co-relation 62793. Up to 7672 conditions per place. [2021-03-11 02:11:42,468 INFO L132 encePairwiseOnDemand]: 108/119 looper letters, 34 selfloop transitions, 38 changer transitions 0/203 dead transitions. [2021-03-11 02:11:42,468 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 203 transitions, 1556 flow [2021-03-11 02:11:42,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-11 02:11:42,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-03-11 02:11:42,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1420 transitions. [2021-03-11 02:11:42,472 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9179056237879767 [2021-03-11 02:11:42,472 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1420 transitions. [2021-03-11 02:11:42,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1420 transitions. [2021-03-11 02:11:42,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:11:42,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1420 transitions. [2021-03-11 02:11:42,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 109.23076923076923) internal successors, (1420), 13 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:42,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:42,479 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 119.0) internal successors, (1666), 14 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:42,479 INFO L185 Difference]: Start difference. First operand has 166 places, 161 transitions, 1132 flow. Second operand 13 states and 1420 transitions. [2021-03-11 02:11:42,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 203 transitions, 1556 flow [2021-03-11 02:11:42,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 203 transitions, 1544 flow, removed 6 selfloop flow, removed 0 redundant places. [2021-03-11 02:11:42,622 INFO L241 Difference]: Finished difference. Result has 184 places, 181 transitions, 1413 flow [2021-03-11 02:11:42,622 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1413, PETRI_PLACES=184, PETRI_TRANSITIONS=181} [2021-03-11 02:11:42,622 INFO L335 CegarLoopForPetriNet]: 126 programPoint places, 58 predicate places. [2021-03-11 02:11:42,623 INFO L480 AbstractCegarLoop]: Abstraction has has 184 places, 181 transitions, 1413 flow [2021-03-11 02:11:42,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 105.14285714285714) internal successors, (736), 7 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:42,623 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:11:42,623 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:11:42,623 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 02:11:42,623 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:11:42,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:11:42,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1494855498, now seen corresponding path program 1 times [2021-03-11 02:11:42,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:11:42,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120352641] [2021-03-11 02:11:42,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:11:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:11:42,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:42,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:11:42,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:42,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:11:42,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:42,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:11:42,693 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-11 02:11:42,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 02:11:42,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:42,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:11:42,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:42,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:11:42,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:42,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:11:42,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:11:42,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120352641] [2021-03-11 02:11:42,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:11:42,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 02:11:42,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805749328] [2021-03-11 02:11:42,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 02:11:42,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:11:42,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 02:11:42,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-03-11 02:11:42,733 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 119 [2021-03-11 02:11:42,734 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 181 transitions, 1413 flow. Second operand has 7 states, 7 states have (on average 105.57142857142857) internal successors, (739), 7 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:42,734 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:11:42,734 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 119 [2021-03-11 02:11:42,734 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:11:45,165 INFO L129 PetriNetUnfolder]: 4716/17247 cut-off events. [2021-03-11 02:11:45,165 INFO L130 PetriNetUnfolder]: For 73158/86738 co-relation queries the response was YES. [2021-03-11 02:11:45,268 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67401 conditions, 17247 events. 4716/17247 cut-off events. For 73158/86738 co-relation queries the response was YES. Maximal size of possible extension queue 2143. Compared 246958 event pairs, 451 based on Foata normal form. 524/16531 useless extension candidates. Maximal degree in co-relation 67287. Up to 5858 conditions per place. [2021-03-11 02:11:45,332 INFO L132 encePairwiseOnDemand]: 113/119 looper letters, 35 selfloop transitions, 15 changer transitions 12/214 dead transitions. [2021-03-11 02:11:45,332 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 214 transitions, 1898 flow [2021-03-11 02:11:45,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 02:11:45,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 02:11:45,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 750 transitions. [2021-03-11 02:11:45,334 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9003601440576231 [2021-03-11 02:11:45,334 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 750 transitions. [2021-03-11 02:11:45,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 750 transitions. [2021-03-11 02:11:45,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:11:45,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 750 transitions. [2021-03-11 02:11:45,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.14285714285714) internal successors, (750), 7 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:45,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:45,338 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:45,338 INFO L185 Difference]: Start difference. First operand has 184 places, 181 transitions, 1413 flow. Second operand 7 states and 750 transitions. [2021-03-11 02:11:45,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 214 transitions, 1898 flow [2021-03-11 02:11:47,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 214 transitions, 1770 flow, removed 38 selfloop flow, removed 5 redundant places. [2021-03-11 02:11:47,313 INFO L241 Difference]: Finished difference. Result has 190 places, 192 transitions, 1496 flow [2021-03-11 02:11:47,313 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=1289, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1496, PETRI_PLACES=190, PETRI_TRANSITIONS=192} [2021-03-11 02:11:47,314 INFO L335 CegarLoopForPetriNet]: 126 programPoint places, 64 predicate places. [2021-03-11 02:11:47,314 INFO L480 AbstractCegarLoop]: Abstraction has has 190 places, 192 transitions, 1496 flow [2021-03-11 02:11:47,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 105.57142857142857) internal successors, (739), 7 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:47,314 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:11:47,314 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:11:47,314 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 02:11:47,315 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:11:47,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:11:47,315 INFO L82 PathProgramCache]: Analyzing trace with hash -423348392, now seen corresponding path program 2 times [2021-03-11 02:11:47,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:11:47,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463849102] [2021-03-11 02:11:47,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:11:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:11:47,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:47,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:11:47,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:47,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:11:47,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:47,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:11:47,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:47,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:11:47,383 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-03-11 02:11:47,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-11 02:11:47,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:47,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 02:11:47,408 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 02:11:47,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:11:47,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:47,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:11:47,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:11:47,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463849102] [2021-03-11 02:11:47,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:11:47,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-11 02:11:47,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416253444] [2021-03-11 02:11:47,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 02:11:47,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:11:47,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 02:11:47,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-11 02:11:47,420 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 119 [2021-03-11 02:11:47,421 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 192 transitions, 1496 flow. Second operand has 8 states, 8 states have (on average 105.125) internal successors, (841), 8 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:47,421 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:11:47,421 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 119 [2021-03-11 02:11:47,421 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:11:50,871 INFO L129 PetriNetUnfolder]: 10783/23851 cut-off events. [2021-03-11 02:11:50,871 INFO L130 PetriNetUnfolder]: For 156487/201961 co-relation queries the response was YES. [2021-03-11 02:11:51,124 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108506 conditions, 23851 events. 10783/23851 cut-off events. For 156487/201961 co-relation queries the response was YES. Maximal size of possible extension queue 3443. Compared 295956 event pairs, 67 based on Foata normal form. 4554/26198 useless extension candidates. Maximal degree in co-relation 108392. Up to 8152 conditions per place. [2021-03-11 02:11:51,169 INFO L132 encePairwiseOnDemand]: 108/119 looper letters, 28 selfloop transitions, 58 changer transitions 39/240 dead transitions. [2021-03-11 02:11:51,169 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 240 transitions, 2190 flow [2021-03-11 02:11:51,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-03-11 02:11:51,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-03-11 02:11:51,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1749 transitions. [2021-03-11 02:11:51,174 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9185924369747899 [2021-03-11 02:11:51,174 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1749 transitions. [2021-03-11 02:11:51,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1749 transitions. [2021-03-11 02:11:51,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:11:51,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1749 transitions. [2021-03-11 02:11:51,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 109.3125) internal successors, (1749), 16 states have internal predecessors, (1749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:51,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 119.0) internal successors, (2023), 17 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:51,184 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 119.0) internal successors, (2023), 17 states have internal predecessors, (2023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:51,184 INFO L185 Difference]: Start difference. First operand has 190 places, 192 transitions, 1496 flow. Second operand 16 states and 1749 transitions. [2021-03-11 02:11:51,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 240 transitions, 2190 flow [2021-03-11 02:11:52,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 240 transitions, 2161 flow, removed 11 selfloop flow, removed 2 redundant places. [2021-03-11 02:11:52,922 INFO L241 Difference]: Finished difference. Result has 207 places, 191 transitions, 1549 flow [2021-03-11 02:11:52,922 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=1467, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1549, PETRI_PLACES=207, PETRI_TRANSITIONS=191} [2021-03-11 02:11:52,922 INFO L335 CegarLoopForPetriNet]: 126 programPoint places, 81 predicate places. [2021-03-11 02:11:52,922 INFO L480 AbstractCegarLoop]: Abstraction has has 207 places, 191 transitions, 1549 flow [2021-03-11 02:11:52,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 105.125) internal successors, (841), 8 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:52,923 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:11:52,923 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:11:52,923 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 02:11:52,923 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:11:52,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:11:52,924 INFO L82 PathProgramCache]: Analyzing trace with hash -381124763, now seen corresponding path program 1 times [2021-03-11 02:11:52,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:11:52,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667437030] [2021-03-11 02:11:52,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:11:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 02:11:52,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:52,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:11:52,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:52,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:11:53,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:53,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:11:53,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:53,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:11:53,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:53,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 02:11:53,015 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-03-11 02:11:53,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-11 02:11:53,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:53,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 02:11:53,039 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-11 02:11:53,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-11 02:11:53,048 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 02:11:53,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 02:11:53,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 02:11:53,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667437030] [2021-03-11 02:11:53,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 02:11:53,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-11 02:11:53,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957197124] [2021-03-11 02:11:53,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 02:11:53,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 02:11:53,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 02:11:53,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-03-11 02:11:53,053 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 119 [2021-03-11 02:11:53,054 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 191 transitions, 1549 flow. Second operand has 9 states, 9 states have (on average 105.11111111111111) internal successors, (946), 9 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:53,054 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 02:11:53,054 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 119 [2021-03-11 02:11:53,054 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 02:11:56,144 INFO L129 PetriNetUnfolder]: 8800/20033 cut-off events. [2021-03-11 02:11:56,144 INFO L130 PetriNetUnfolder]: For 163830/197014 co-relation queries the response was YES. [2021-03-11 02:11:56,306 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104357 conditions, 20033 events. 8800/20033 cut-off events. For 163830/197014 co-relation queries the response was YES. Maximal size of possible extension queue 2988. Compared 249903 event pairs, 39 based on Foata normal form. 3352/21545 useless extension candidates. Maximal degree in co-relation 104302. Up to 6629 conditions per place. [2021-03-11 02:11:56,351 INFO L132 encePairwiseOnDemand]: 108/119 looper letters, 22 selfloop transitions, 63 changer transitions 28/226 dead transitions. [2021-03-11 02:11:56,351 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 226 transitions, 2082 flow [2021-03-11 02:11:56,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-03-11 02:11:56,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-03-11 02:11:56,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2058 transitions. [2021-03-11 02:11:56,355 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.9102167182662538 [2021-03-11 02:11:56,355 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2058 transitions. [2021-03-11 02:11:56,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2058 transitions. [2021-03-11 02:11:56,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 02:11:56,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2058 transitions. [2021-03-11 02:11:56,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 108.3157894736842) internal successors, (2058), 19 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:56,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 119.0) internal successors, (2380), 20 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:56,364 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 119.0) internal successors, (2380), 20 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:11:56,364 INFO L185 Difference]: Start difference. First operand has 207 places, 191 transitions, 1549 flow. Second operand 19 states and 2058 transitions. [2021-03-11 02:11:56,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 226 transitions, 2082 flow [2021-03-11 02:12:04,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 226 transitions, 1604 flow, removed 191 selfloop flow, removed 28 redundant places. [2021-03-11 02:12:04,489 INFO L241 Difference]: Finished difference. Result has 192 places, 188 transitions, 1289 flow [2021-03-11 02:12:04,489 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=119, PETRI_DIFFERENCE_MINUEND_FLOW=1143, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1289, PETRI_PLACES=192, PETRI_TRANSITIONS=188} [2021-03-11 02:12:04,489 INFO L335 CegarLoopForPetriNet]: 126 programPoint places, 66 predicate places. [2021-03-11 02:12:04,490 INFO L480 AbstractCegarLoop]: Abstraction has has 192 places, 188 transitions, 1289 flow [2021-03-11 02:12:04,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 105.11111111111111) internal successors, (946), 9 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 02:12:04,490 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 02:12:04,490 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 02:12:04,490 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 02:12:04,490 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 02:12:04,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 02:12:04,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1839508653, now seen corresponding path program 1 times [2021-03-11 02:12:04,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 02:12:04,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602509712] [2021-03-11 02:12:04,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 02:12:04,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 02:12:04,547 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 02:12:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 02:12:04,607 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 02:12:04,645 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 02:12:04,645 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 02:12:04,645 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 02:12:04,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 02:12:04 BasicIcfg [2021-03-11 02:12:04,829 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 02:12:04,830 INFO L168 Benchmark]: Toolchain (without parser) took 35969.12 ms. Allocated memory was 350.2 MB in the beginning and 10.3 GB in the end (delta: 9.9 GB). Free memory was 312.9 MB in the beginning and 8.0 GB in the end (delta: -7.7 GB). Peak memory consumption was 2.3 GB. Max. memory is 16.0 GB. [2021-03-11 02:12:04,830 INFO L168 Benchmark]: CDTParser took 0.81 ms. Allocated memory is still 350.2 MB. Free memory was 331.3 MB in the beginning and 331.2 MB in the end (delta: 75.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 02:12:04,830 INFO L168 Benchmark]: CACSL2BoogieTranslator took 573.56 ms. Allocated memory is still 350.2 MB. Free memory was 312.3 MB in the beginning and 308.1 MB in the end (delta: 4.1 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB. [2021-03-11 02:12:04,830 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.53 ms. Allocated memory is still 350.2 MB. Free memory was 308.1 MB in the beginning and 305.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-11 02:12:04,832 INFO L168 Benchmark]: Boogie Preprocessor took 56.71 ms. Allocated memory is still 350.2 MB. Free memory was 305.0 MB in the beginning and 302.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 02:12:04,836 INFO L168 Benchmark]: RCFGBuilder took 1793.10 ms. Allocated memory is still 350.2 MB. Free memory was 302.9 MB in the beginning and 223.5 MB in the end (delta: 79.4 MB). Peak memory consumption was 152.3 MB. Max. memory is 16.0 GB. [2021-03-11 02:12:04,838 INFO L168 Benchmark]: TraceAbstraction took 33464.15 ms. Allocated memory was 350.2 MB in the beginning and 10.3 GB in the end (delta: 9.9 GB). Free memory was 223.5 MB in the beginning and 8.0 GB in the end (delta: -7.7 GB). Peak memory consumption was 2.2 GB. Max. memory is 16.0 GB. [2021-03-11 02:12:04,839 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.81 ms. Allocated memory is still 350.2 MB. Free memory was 331.3 MB in the beginning and 331.2 MB in the end (delta: 75.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 573.56 ms. Allocated memory is still 350.2 MB. Free memory was 312.3 MB in the beginning and 308.1 MB in the end (delta: 4.1 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 72.53 ms. Allocated memory is still 350.2 MB. Free memory was 308.1 MB in the beginning and 305.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 56.71 ms. Allocated memory is still 350.2 MB. Free memory was 305.0 MB in the beginning and 302.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1793.10 ms. Allocated memory is still 350.2 MB. Free memory was 302.9 MB in the beginning and 223.5 MB in the end (delta: 79.4 MB). Peak memory consumption was 152.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 33464.15 ms. Allocated memory was 350.2 MB in the beginning and 10.3 GB in the end (delta: 9.9 GB). Free memory was 223.5 MB in the beginning and 8.0 GB in the end (delta: -7.7 GB). Peak memory consumption was 2.2 GB. 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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L714] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0] [L718] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L720] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L721] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0] [L722] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L723] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L724] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L725] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L726] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0] [L727] 0 _Bool a$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0] [L728] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0] [L729] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L730] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L731] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0] [L732] 0 _Bool a$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0] [L733] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0] [L734] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L735] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L736] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L737] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L738] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L739] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L740] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L742] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L744] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L746] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L747] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L748] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L869] 0 pthread_t t209; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] FCALL, FORK 0 pthread_create(&t209, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t210; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] FCALL, FORK 0 pthread_create(&t210, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t211; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L874] FCALL, FORK 0 pthread_create(&t211, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L802] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L805] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L808] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L875] 0 pthread_t t212; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L876] FCALL, FORK 0 pthread_create(&t212, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L825] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 a$flush_delayed = weak$$choice2 [L834] 4 a$mem_tmp = a [L835] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L835] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L836] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L836] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L837] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L837] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L838] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L838] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L839] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L840] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L841] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = a [L843] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L843] 4 a = a$flush_delayed ? a$mem_tmp : a [L844] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=1] [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L788] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=1] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=1] [L811] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L811] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L811] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L811] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L812] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L813] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L814] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L815] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=1] [L847] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L847] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L847] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L847] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L848] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L848] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L849] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L850] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L850] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L851] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=1] [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=1] [L882] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L882] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L882] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L882] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L883] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L883] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L884] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L885] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L885] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L886] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L886] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L889] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 118 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 33169.5ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 31289.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 57.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 184 SDtfs, 414 SDslu, 608 SDs, 0 SdLazy, 602 SolverSat, 189 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 533.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1298.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1549occurred in iteration=10, InterpolantAutomatonStates: 119, 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: 53.5ms SsaConstructionTime, 420.9ms SatisfiabilityAnalysisTime, 1058.6ms InterpolantComputationTime, 909 NumberOfCodeBlocks, 909 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 808 ConstructedInterpolants, 0 QuantifiedInterpolants, 3116 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...