/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-OGIterative-Hitting.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe023_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-13 11:21:20,666 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-13 11:21:20,668 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-13 11:21:20,694 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-13 11:21:20,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-13 11:21:20,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-13 11:21:20,697 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-13 11:21:20,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-13 11:21:20,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-13 11:21:20,701 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-13 11:21:20,702 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-13 11:21:20,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-13 11:21:20,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-13 11:21:20,705 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-13 11:21:20,706 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-13 11:21:20,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-13 11:21:20,707 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-13 11:21:20,708 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-13 11:21:20,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-13 11:21:20,720 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-13 11:21:20,721 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-13 11:21:20,725 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-13 11:21:20,726 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-13 11:21:20,727 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-13 11:21:20,729 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-13 11:21:20,730 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-13 11:21:20,730 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-13 11:21:20,731 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-13 11:21:20,731 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-13 11:21:20,732 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-13 11:21:20,732 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-13 11:21:20,733 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-13 11:21:20,733 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-13 11:21:20,734 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-13 11:21:20,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-13 11:21:20,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-13 11:21:20,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-13 11:21:20,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-13 11:21:20,741 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-13 11:21:20,742 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-13 11:21:20,743 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-13 11:21:20,744 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-OGIterative-Hitting.epf [2021-08-13 11:21:20,784 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-13 11:21:20,784 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-13 11:21:20,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-13 11:21:20,788 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-13 11:21:20,788 INFO L138 SettingsManager]: * Use SBE=true [2021-08-13 11:21:20,788 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-13 11:21:20,788 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-13 11:21:20,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-13 11:21:20,789 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-13 11:21:20,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-13 11:21:20,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-13 11:21:20,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-13 11:21:20,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-13 11:21:20,790 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-13 11:21:20,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-13 11:21:20,791 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-13 11:21:20,791 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-13 11:21:20,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-13 11:21:20,791 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-13 11:21:20,791 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-13 11:21:20,791 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-13 11:21:20,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 11:21:20,792 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-13 11:21:20,792 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-13 11:21:20,792 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-13 11:21:20,792 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-13 11:21:20,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-13 11:21:20,792 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-13 11:21:20,792 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-13 11:21:20,793 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-13 11:21:20,793 INFO L138 SettingsManager]: * Compute cosets for OwickiGries annotation iteratively=true [2021-08-13 11:21:20,793 INFO L138 SettingsManager]: * Use hitting sets in computation of OwickiGries annotation=true [2021-08-13 11:21:20,793 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-08-13 11:21:21,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-13 11:21:21,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-13 11:21:21,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-13 11:21:21,123 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-13 11:21:21,123 INFO L275 PluginConnector]: CDTParser initialized [2021-08-13 11:21:21,124 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_rmo.oepc.i [2021-08-13 11:21:21,197 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27f352907/ad1ad454a4954f5dbf40ca25f05e64c4/FLAG1f5ab2664 [2021-08-13 11:21:21,862 INFO L306 CDTParser]: Found 1 translation units. [2021-08-13 11:21:21,863 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_rmo.oepc.i [2021-08-13 11:21:21,882 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27f352907/ad1ad454a4954f5dbf40ca25f05e64c4/FLAG1f5ab2664 [2021-08-13 11:21:22,213 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27f352907/ad1ad454a4954f5dbf40ca25f05e64c4 [2021-08-13 11:21:22,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-13 11:21:22,218 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-13 11:21:22,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-13 11:21:22,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-13 11:21:22,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-13 11:21:22,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 11:21:22" (1/1) ... [2021-08-13 11:21:22,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3464e1ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:21:22, skipping insertion in model container [2021-08-13 11:21:22,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 11:21:22" (1/1) ... [2021-08-13 11:21:22,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-13 11:21:22,287 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-13 11:21:22,459 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_rmo.oepc.i[993,1006] [2021-08-13 11:21:22,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 11:21:22,697 INFO L203 MainTranslator]: Completed pre-run [2021-08-13 11:21:22,707 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_rmo.oepc.i[993,1006] [2021-08-13 11:21:22,758 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 11:21:22,811 INFO L208 MainTranslator]: Completed translation [2021-08-13 11:21:22,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:21:22 WrapperNode [2021-08-13 11:21:22,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-13 11:21:22,813 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-13 11:21:22,813 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-13 11:21:22,813 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-13 11:21:22,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:21:22" (1/1) ... [2021-08-13 11:21:22,835 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:21:22" (1/1) ... [2021-08-13 11:21:22,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-13 11:21:22,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-13 11:21:22,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-13 11:21:22,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-13 11:21:22,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:21:22" (1/1) ... [2021-08-13 11:21:22,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:21:22" (1/1) ... [2021-08-13 11:21:22,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:21:22" (1/1) ... [2021-08-13 11:21:22,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:21:22" (1/1) ... [2021-08-13 11:21:22,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:21:22" (1/1) ... [2021-08-13 11:21:22,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:21:22" (1/1) ... [2021-08-13 11:21:22,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:21:22" (1/1) ... [2021-08-13 11:21:22,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-13 11:21:22,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-13 11:21:22,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-13 11:21:22,933 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-13 11:21:22,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:21:22" (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-08-13 11:21:23,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-13 11:21:23,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-13 11:21:23,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-13 11:21:23,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-13 11:21:23,034 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-13 11:21:23,034 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-13 11:21:23,034 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-13 11:21:23,034 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-13 11:21:23,034 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-13 11:21:23,034 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-13 11:21:23,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-13 11:21:23,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-13 11:21:23,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-13 11:21:23,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-13 11:21:23,037 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-13 11:21:26,183 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-13 11:21:26,183 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-13 11:21:26,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 11:21:26 BoogieIcfgContainer [2021-08-13 11:21:26,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-13 11:21:26,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-13 11:21:26,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-13 11:21:26,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-13 11:21:26,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.08 11:21:22" (1/3) ... [2021-08-13 11:21:26,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@560a50ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 11:21:26, skipping insertion in model container [2021-08-13 11:21:26,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:21:22" (2/3) ... [2021-08-13 11:21:26,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@560a50ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 11:21:26, skipping insertion in model container [2021-08-13 11:21:26,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 11:21:26" (3/3) ... [2021-08-13 11:21:26,192 INFO L111 eAbstractionObserver]: Analyzing ICFG safe023_rmo.oepc.i [2021-08-13 11:21:26,197 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-13 11:21:26,198 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-13 11:21:26,198 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-13 11:21:26,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,239 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,239 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,239 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,239 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,239 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,240 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,241 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,242 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,243 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,244 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,244 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,244 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,244 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,244 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,244 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,244 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,244 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,244 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,244 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,244 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,244 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,245 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,245 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,246 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,246 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,246 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,246 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,250 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,252 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,252 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,252 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,252 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,252 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,252 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,254 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,254 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,255 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,255 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,255 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,255 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,255 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,255 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,255 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,255 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,256 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,259 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,259 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,259 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,259 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,269 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,269 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,269 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,269 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,269 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,269 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,270 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,270 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,270 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,270 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,270 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,270 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,270 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,270 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,271 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,271 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,271 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,271 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,273 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,273 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,273 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,274 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,274 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,275 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,280 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,280 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,284 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,284 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,284 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:21:26,286 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-13 11:21:26,305 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-13 11:21:26,322 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-13 11:21:26,322 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-13 11:21:26,322 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-13 11:21:26,322 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-13 11:21:26,323 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-13 11:21:26,323 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-13 11:21:26,323 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-13 11:21:26,323 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-13 11:21:26,332 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2021-08-13 11:21:26,365 INFO L129 PetriNetUnfolder]: 2/105 cut-off events. [2021-08-13 11:21:26,365 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 11:21:26,368 INFO L84 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2021-08-13 11:21:26,368 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2021-08-13 11:21:26,372 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2021-08-13 11:21:26,382 INFO L129 PetriNetUnfolder]: 0/57 cut-off events. [2021-08-13 11:21:26,383 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 11:21:26,383 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:21:26,384 INFO L266 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] [2021-08-13 11:21:26,384 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:21:26,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:21:26,389 INFO L82 PathProgramCache]: Analyzing trace with hash -865950546, now seen corresponding path program 1 times [2021-08-13 11:21:26,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:21:26,396 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929789035] [2021-08-13 11:21:26,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:21:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:21:26,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:26,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:21:26,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:26,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:21:26,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 11:21:26,660 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:21:26,661 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929789035] [2021-08-13 11:21:26,662 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929789035] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:21:26,662 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:21:26,662 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-13 11:21:26,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698573354] [2021-08-13 11:21:26,670 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-13 11:21:26,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:21:26,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-13 11:21:26,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-13 11:21:26,685 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 108 [2021-08-13 11:21:26,690 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 105 transitions, 219 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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-08-13 11:21:26,690 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:21:26,690 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 108 [2021-08-13 11:21:26,691 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:21:27,022 INFO L129 PetriNetUnfolder]: 190/1025 cut-off events. [2021-08-13 11:21:27,023 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 11:21:27,029 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1334 conditions, 1025 events. 190/1025 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 7819 event pairs, 104 based on Foata normal form. 54/1011 useless extension candidates. Maximal degree in co-relation 1286. Up to 223 conditions per place. [2021-08-13 11:21:27,035 INFO L132 encePairwiseOnDemand]: 103/108 looper letters, 15 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2021-08-13 11:21:27,036 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 108 transitions, 259 flow [2021-08-13 11:21:27,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-13 11:21:27,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-13 11:21:27,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2021-08-13 11:21:27,052 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9382716049382716 [2021-08-13 11:21:27,053 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2021-08-13 11:21:27,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2021-08-13 11:21:27,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:21:27,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2021-08-13 11:21:27,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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-08-13 11:21:27,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:21:27,070 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:21:27,071 INFO L348 CegarLoopForPetriNet]: 113 programPoint places, 0 predicate places. [2021-08-13 11:21:27,071 INFO L482 AbstractCegarLoop]: Abstraction has has 113 places, 108 transitions, 259 flow [2021-08-13 11:21:27,071 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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-08-13 11:21:27,071 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:21:27,072 INFO L266 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-08-13 11:21:27,072 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-13 11:21:27,072 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:21:27,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:21:27,073 INFO L82 PathProgramCache]: Analyzing trace with hash -64619290, now seen corresponding path program 1 times [2021-08-13 11:21:27,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:21:27,073 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147239497] [2021-08-13 11:21:27,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:21:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:21:27,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:27,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:21:27,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:27,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:21:27,254 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:21:27,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:21:27,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:27,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:21:27,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:27,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:21:27,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:27,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:21:27,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 11:21:27,292 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:21:27,292 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147239497] [2021-08-13 11:21:27,292 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147239497] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:21:27,293 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:21:27,293 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 11:21:27,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83487357] [2021-08-13 11:21:27,294 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 11:21:27,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:21:27,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 11:21:27,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 11:21:27,296 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 108 [2021-08-13 11:21:27,297 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 108 transitions, 259 flow. Second operand has 6 states, 6 states have (on average 97.16666666666667) internal successors, (583), 6 states have internal predecessors, (583), 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-08-13 11:21:27,297 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:21:27,297 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 108 [2021-08-13 11:21:27,297 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:21:27,639 INFO L129 PetriNetUnfolder]: 289/1520 cut-off events. [2021-08-13 11:21:27,640 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2021-08-13 11:21:27,646 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2304 conditions, 1520 events. 289/1520 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 13522 event pairs, 125 based on Foata normal form. 0/1452 useless extension candidates. Maximal degree in co-relation 2253. Up to 289 conditions per place. [2021-08-13 11:21:27,651 INFO L132 encePairwiseOnDemand]: 102/108 looper letters, 8 selfloop transitions, 2 changer transitions 13/121 dead transitions. [2021-08-13 11:21:27,651 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 121 transitions, 335 flow [2021-08-13 11:21:27,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 11:21:27,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 11:21:27,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 887 transitions. [2021-08-13 11:21:27,654 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9125514403292181 [2021-08-13 11:21:27,655 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 887 transitions. [2021-08-13 11:21:27,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 887 transitions. [2021-08-13 11:21:27,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:21:27,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 887 transitions. [2021-08-13 11:21:27,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.55555555555556) internal successors, (887), 9 states have internal predecessors, (887), 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-08-13 11:21:27,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 108.0) internal successors, (1080), 10 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:21:27,661 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 108.0) internal successors, (1080), 10 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:21:27,661 INFO L348 CegarLoopForPetriNet]: 113 programPoint places, 8 predicate places. [2021-08-13 11:21:27,661 INFO L482 AbstractCegarLoop]: Abstraction has has 121 places, 121 transitions, 335 flow [2021-08-13 11:21:27,662 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 97.16666666666667) internal successors, (583), 6 states have internal predecessors, (583), 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-08-13 11:21:27,662 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:21:27,662 INFO L266 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] [2021-08-13 11:21:27,662 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-13 11:21:27,663 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:21:27,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:21:27,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1063245287, now seen corresponding path program 1 times [2021-08-13 11:21:27,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:21:27,664 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147221745] [2021-08-13 11:21:27,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:21:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:21:27,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:27,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:21:27,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:27,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:21:27,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:27,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:21:27,766 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:21:27,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:21:27,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:27,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:21:27,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:27,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:21:27,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:27,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:21:27,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 11:21:27,806 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:21:27,806 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147221745] [2021-08-13 11:21:27,806 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147221745] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:21:27,806 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:21:27,806 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 11:21:27,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800006399] [2021-08-13 11:21:27,807 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 11:21:27,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:21:27,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 11:21:27,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-13 11:21:27,809 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 108 [2021-08-13 11:21:27,810 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 121 transitions, 335 flow. Second operand has 7 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 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-08-13 11:21:27,810 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:21:27,810 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 108 [2021-08-13 11:21:27,810 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:21:28,431 INFO L129 PetriNetUnfolder]: 670/2957 cut-off events. [2021-08-13 11:21:28,431 INFO L130 PetriNetUnfolder]: For 239/295 co-relation queries the response was YES. [2021-08-13 11:21:28,445 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5183 conditions, 2957 events. 670/2957 cut-off events. For 239/295 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 30089 event pairs, 249 based on Foata normal form. 12/2883 useless extension candidates. Maximal degree in co-relation 5128. Up to 718 conditions per place. [2021-08-13 11:21:28,450 INFO L132 encePairwiseOnDemand]: 100/108 looper letters, 8 selfloop transitions, 4 changer transitions 45/151 dead transitions. [2021-08-13 11:21:28,451 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 151 transitions, 565 flow [2021-08-13 11:21:28,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 11:21:28,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 11:21:28,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1259 transitions. [2021-08-13 11:21:28,454 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8967236467236467 [2021-08-13 11:21:28,454 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1259 transitions. [2021-08-13 11:21:28,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1259 transitions. [2021-08-13 11:21:28,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:21:28,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1259 transitions. [2021-08-13 11:21:28,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.84615384615384) internal successors, (1259), 13 states have internal predecessors, (1259), 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-08-13 11:21:28,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 108.0) internal successors, (1512), 14 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:21:28,461 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 108.0) internal successors, (1512), 14 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:21:28,461 INFO L348 CegarLoopForPetriNet]: 113 programPoint places, 20 predicate places. [2021-08-13 11:21:28,461 INFO L482 AbstractCegarLoop]: Abstraction has has 133 places, 151 transitions, 565 flow [2021-08-13 11:21:28,461 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 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-08-13 11:21:28,461 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:21:28,462 INFO L266 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-08-13 11:21:28,462 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-13 11:21:28,462 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:21:28,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:21:28,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1981191740, now seen corresponding path program 1 times [2021-08-13 11:21:28,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:21:28,463 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314440704] [2021-08-13 11:21:28,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:21:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:21:28,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:28,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:21:28,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:28,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:21:28,580 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:21:28,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:21:28,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:28,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:21:28,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:28,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:21:28,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:28,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:21:28,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 11:21:28,614 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:21:28,614 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314440704] [2021-08-13 11:21:28,614 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314440704] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:21:28,614 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:21:28,614 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 11:21:28,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682338752] [2021-08-13 11:21:28,615 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 11:21:28,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:21:28,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 11:21:28,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 11:21:28,617 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 108 [2021-08-13 11:21:28,618 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 151 transitions, 565 flow. Second operand has 6 states, 6 states have (on average 97.16666666666667) internal successors, (583), 6 states have internal predecessors, (583), 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-08-13 11:21:28,618 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:21:28,618 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 108 [2021-08-13 11:21:28,618 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:21:29,342 INFO L129 PetriNetUnfolder]: 967/3934 cut-off events. [2021-08-13 11:21:29,343 INFO L130 PetriNetUnfolder]: For 1099/1147 co-relation queries the response was YES. [2021-08-13 11:21:29,363 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7822 conditions, 3934 events. 967/3934 cut-off events. For 1099/1147 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 41750 event pairs, 349 based on Foata normal form. 4/3817 useless extension candidates. Maximal degree in co-relation 7764. Up to 1015 conditions per place. [2021-08-13 11:21:29,369 INFO L132 encePairwiseOnDemand]: 102/108 looper letters, 7 selfloop transitions, 3 changer transitions 122/228 dead transitions. [2021-08-13 11:21:29,369 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 228 transitions, 1271 flow [2021-08-13 11:21:29,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 11:21:29,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 11:21:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 887 transitions. [2021-08-13 11:21:29,372 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9125514403292181 [2021-08-13 11:21:29,372 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 887 transitions. [2021-08-13 11:21:29,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 887 transitions. [2021-08-13 11:21:29,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:21:29,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 887 transitions. [2021-08-13 11:21:29,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.55555555555556) internal successors, (887), 9 states have internal predecessors, (887), 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-08-13 11:21:29,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 108.0) internal successors, (1080), 10 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:21:29,376 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 108.0) internal successors, (1080), 10 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:21:29,377 INFO L348 CegarLoopForPetriNet]: 113 programPoint places, 28 predicate places. [2021-08-13 11:21:29,377 INFO L482 AbstractCegarLoop]: Abstraction has has 141 places, 228 transitions, 1271 flow [2021-08-13 11:21:29,377 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 97.16666666666667) internal successors, (583), 6 states have internal predecessors, (583), 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-08-13 11:21:29,377 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:21:29,377 INFO L266 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] [2021-08-13 11:21:29,378 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-13 11:21:29,378 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:21:29,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:21:29,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1985959078, now seen corresponding path program 1 times [2021-08-13 11:21:29,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:21:29,378 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78700558] [2021-08-13 11:21:29,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:21:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:21:29,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:29,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:21:29,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:29,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:21:29,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:29,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:21:29,648 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-08-13 11:21:29,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-08-13 11:21:29,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:29,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:21:29,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:29,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 11:21:29,678 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-08-13 11:21:29,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-08-13 11:21:29,694 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:21:29,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:21:29,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:29,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:21:29,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:29,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:21:29,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:29,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:21:29,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 11:21:29,739 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:21:29,739 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78700558] [2021-08-13 11:21:29,740 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78700558] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:21:29,740 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:21:29,740 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-13 11:21:29,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189720794] [2021-08-13 11:21:29,740 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-08-13 11:21:29,741 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:21:29,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-13 11:21:29,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-13 11:21:29,743 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 108 [2021-08-13 11:21:29,744 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 228 transitions, 1271 flow. Second operand has 9 states, 9 states have (on average 84.77777777777777) internal successors, (763), 9 states have internal predecessors, (763), 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-08-13 11:21:29,744 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:21:29,744 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 108 [2021-08-13 11:21:29,744 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:21:31,868 INFO L129 PetriNetUnfolder]: 3821/9968 cut-off events. [2021-08-13 11:21:31,869 INFO L130 PetriNetUnfolder]: For 6092/7277 co-relation queries the response was YES. [2021-08-13 11:21:31,913 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24989 conditions, 9968 events. 3821/9968 cut-off events. For 6092/7277 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 102402 event pairs, 1130 based on Foata normal form. 19/9869 useless extension candidates. Maximal degree in co-relation 24924. Up to 3663 conditions per place. [2021-08-13 11:21:31,926 INFO L132 encePairwiseOnDemand]: 95/108 looper letters, 22 selfloop transitions, 10 changer transitions 354/458 dead transitions. [2021-08-13 11:21:31,926 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 458 transitions, 3623 flow [2021-08-13 11:21:31,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-13 11:21:31,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-08-13 11:21:31,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1613 transitions. [2021-08-13 11:21:31,931 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8297325102880658 [2021-08-13 11:21:31,931 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1613 transitions. [2021-08-13 11:21:31,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1613 transitions. [2021-08-13 11:21:31,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:21:31,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1613 transitions. [2021-08-13 11:21:31,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 89.61111111111111) internal successors, (1613), 18 states have internal predecessors, (1613), 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-08-13 11:21:31,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 108.0) internal successors, (2052), 19 states have internal predecessors, (2052), 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-08-13 11:21:31,939 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 108.0) internal successors, (2052), 19 states have internal predecessors, (2052), 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-08-13 11:21:31,939 INFO L348 CegarLoopForPetriNet]: 113 programPoint places, 45 predicate places. [2021-08-13 11:21:31,939 INFO L482 AbstractCegarLoop]: Abstraction has has 158 places, 458 transitions, 3623 flow [2021-08-13 11:21:31,940 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 84.77777777777777) internal successors, (763), 9 states have internal predecessors, (763), 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-08-13 11:21:31,940 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:21:31,940 INFO L266 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] [2021-08-13 11:21:31,940 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-13 11:21:31,940 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:21:31,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:21:31,942 INFO L82 PathProgramCache]: Analyzing trace with hash -295439562, now seen corresponding path program 2 times [2021-08-13 11:21:31,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:21:31,942 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889396795] [2021-08-13 11:21:31,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:21:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:21:32,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:32,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:21:32,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:32,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:21:32,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:32,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:21:32,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:32,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 11:21:32,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:32,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 11:21:32,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:32,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 11:21:32,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:32,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:21:32,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:32,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-08-13 11:21:32,220 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-08-13 11:21:32,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-08-13 11:21:32,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:32,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 11:21:32,269 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-08-13 11:21:32,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-08-13 11:21:32,297 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-08-13 11:21:32,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-08-13 11:21:32,324 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:21:32,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:21:32,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:32,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:21:32,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:32,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:21:32,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:32,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:21:32,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 11:21:32,377 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:21:32,377 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889396795] [2021-08-13 11:21:32,377 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889396795] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:21:32,377 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:21:32,377 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-08-13 11:21:32,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023693582] [2021-08-13 11:21:32,378 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-08-13 11:21:32,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:21:32,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-13 11:21:32,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2021-08-13 11:21:32,380 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 108 [2021-08-13 11:21:32,381 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 458 transitions, 3623 flow. Second operand has 16 states, 16 states have (on average 80.25) internal successors, (1284), 16 states have internal predecessors, (1284), 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-08-13 11:21:32,381 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:21:32,381 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 108 [2021-08-13 11:21:32,381 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:21:35,982 INFO L129 PetriNetUnfolder]: 6426/16971 cut-off events. [2021-08-13 11:21:35,983 INFO L130 PetriNetUnfolder]: For 11868/14337 co-relation queries the response was YES. [2021-08-13 11:21:36,046 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51443 conditions, 16971 events. 6426/16971 cut-off events. For 11868/14337 co-relation queries the response was YES. Maximal size of possible extension queue 952. Compared 192338 event pairs, 1068 based on Foata normal form. 80/16913 useless extension candidates. Maximal degree in co-relation 51367. Up to 6655 conditions per place. [2021-08-13 11:21:36,065 INFO L132 encePairwiseOnDemand]: 91/108 looper letters, 26 selfloop transitions, 18 changer transitions 739/851 dead transitions. [2021-08-13 11:21:36,066 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 851 transitions, 8685 flow [2021-08-13 11:21:36,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-13 11:21:36,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2021-08-13 11:21:36,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1957 transitions. [2021-08-13 11:21:36,072 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.787842190016103 [2021-08-13 11:21:36,072 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1957 transitions. [2021-08-13 11:21:36,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1957 transitions. [2021-08-13 11:21:36,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:21:36,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1957 transitions. [2021-08-13 11:21:36,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 85.08695652173913) internal successors, (1957), 23 states have internal predecessors, (1957), 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-08-13 11:21:36,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 108.0) internal successors, (2592), 24 states have internal predecessors, (2592), 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-08-13 11:21:36,083 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 108.0) internal successors, (2592), 24 states have internal predecessors, (2592), 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-08-13 11:21:36,083 INFO L348 CegarLoopForPetriNet]: 113 programPoint places, 67 predicate places. [2021-08-13 11:21:36,083 INFO L482 AbstractCegarLoop]: Abstraction has has 180 places, 851 transitions, 8685 flow [2021-08-13 11:21:36,084 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 80.25) internal successors, (1284), 16 states have internal predecessors, (1284), 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-08-13 11:21:36,084 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:21:36,084 INFO L266 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] [2021-08-13 11:21:36,084 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-13 11:21:36,084 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:21:36,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:21:36,085 INFO L82 PathProgramCache]: Analyzing trace with hash -170390044, now seen corresponding path program 3 times [2021-08-13 11:21:36,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:21:36,085 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318127379] [2021-08-13 11:21:36,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:21:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:21:36,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:36,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:21:36,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:36,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:21:36,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:36,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:21:36,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:36,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 11:21:36,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:36,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 11:21:36,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:36,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 11:21:36,268 INFO L142 QuantifierPusher]: treesize reduction 37, result has 43.9 percent of original size [2021-08-13 11:21:36,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-08-13 11:21:36,295 INFO L142 QuantifierPusher]: treesize reduction 27, result has 71.0 percent of original size [2021-08-13 11:21:36,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 66 [2021-08-13 11:21:36,347 INFO L142 QuantifierPusher]: treesize reduction 38, result has 72.7 percent of original size [2021-08-13 11:21:36,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 101 [2021-08-13 11:21:36,361 INFO L142 QuantifierPusher]: treesize reduction 11, result has 80.4 percent of original size [2021-08-13 11:21:36,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-08-13 11:21:36,387 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:21:36,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:21:36,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:36,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:21:36,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:36,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:21:36,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:36,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:21:36,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 11:21:36,433 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:21:36,433 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318127379] [2021-08-13 11:21:36,433 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318127379] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:21:36,433 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:21:36,433 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-13 11:21:36,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423622282] [2021-08-13 11:21:36,434 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-08-13 11:21:36,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:21:36,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-13 11:21:36,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-08-13 11:21:36,436 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 108 [2021-08-13 11:21:36,437 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 851 transitions, 8685 flow. Second operand has 13 states, 13 states have (on average 82.38461538461539) internal successors, (1071), 13 states have internal predecessors, (1071), 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-08-13 11:21:36,437 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:21:36,437 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 108 [2021-08-13 11:21:36,437 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:21:40,994 INFO L129 PetriNetUnfolder]: 9778/25438 cut-off events. [2021-08-13 11:21:40,994 INFO L130 PetriNetUnfolder]: For 21605/27422 co-relation queries the response was YES. [2021-08-13 11:21:41,099 INFO L84 FinitePrefix]: Finished finitePrefix Result has 91671 conditions, 25438 events. 9778/25438 cut-off events. For 21605/27422 co-relation queries the response was YES. Maximal size of possible extension queue 1457. Compared 303941 event pairs, 836 based on Foata normal form. 171/25436 useless extension candidates. Maximal degree in co-relation 91586. Up to 11266 conditions per place. [2021-08-13 11:21:41,127 INFO L132 encePairwiseOnDemand]: 93/108 looper letters, 32 selfloop transitions, 21 changer transitions 1193/1316 dead transitions. [2021-08-13 11:21:41,128 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 1316 transitions, 16465 flow [2021-08-13 11:21:41,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-13 11:21:41,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-08-13 11:21:41,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1592 transitions. [2021-08-13 11:21:41,132 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8189300411522634 [2021-08-13 11:21:41,132 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1592 transitions. [2021-08-13 11:21:41,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1592 transitions. [2021-08-13 11:21:41,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:21:41,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1592 transitions. [2021-08-13 11:21:41,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 88.44444444444444) internal successors, (1592), 18 states have internal predecessors, (1592), 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-08-13 11:21:41,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 108.0) internal successors, (2052), 19 states have internal predecessors, (2052), 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-08-13 11:21:41,145 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 108.0) internal successors, (2052), 19 states have internal predecessors, (2052), 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-08-13 11:21:41,146 INFO L348 CegarLoopForPetriNet]: 113 programPoint places, 84 predicate places. [2021-08-13 11:21:41,146 INFO L482 AbstractCegarLoop]: Abstraction has has 197 places, 1316 transitions, 16465 flow [2021-08-13 11:21:41,146 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 82.38461538461539) internal successors, (1071), 13 states have internal predecessors, (1071), 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-08-13 11:21:41,146 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:21:41,146 INFO L266 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] [2021-08-13 11:21:41,146 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-13 11:21:41,146 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:21:41,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:21:41,147 INFO L82 PathProgramCache]: Analyzing trace with hash 676308112, now seen corresponding path program 4 times [2021-08-13 11:21:41,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:21:41,147 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128379745] [2021-08-13 11:21:41,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:21:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:21:41,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:41,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:21:41,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:41,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:21:41,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:41,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:21:41,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:41,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 11:21:41,308 INFO L142 QuantifierPusher]: treesize reduction 6, result has 91.4 percent of original size [2021-08-13 11:21:41,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2021-08-13 11:21:41,339 INFO L142 QuantifierPusher]: treesize reduction 6, result has 91.4 percent of original size [2021-08-13 11:21:41,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2021-08-13 11:21:41,344 INFO L142 QuantifierPusher]: treesize reduction 6, result has 91.7 percent of original size [2021-08-13 11:21:41,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 66 [2021-08-13 11:21:41,377 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:21:41,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:21:41,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:41,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:21:41,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:41,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:21:41,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:41,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:21:41,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 11:21:41,426 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:21:41,426 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128379745] [2021-08-13 11:21:41,426 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128379745] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:21:41,426 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:21:41,426 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-13 11:21:41,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542225461] [2021-08-13 11:21:41,426 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-13 11:21:41,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:21:41,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-13 11:21:41,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-08-13 11:21:41,427 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 108 [2021-08-13 11:21:41,428 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 1316 transitions, 16465 flow. Second operand has 10 states, 10 states have (on average 82.8) internal successors, (828), 10 states have internal predecessors, (828), 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-08-13 11:21:41,428 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:21:41,428 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 108 [2021-08-13 11:21:41,428 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:21:48,774 INFO L129 PetriNetUnfolder]: 13473/36456 cut-off events. [2021-08-13 11:21:48,775 INFO L130 PetriNetUnfolder]: For 35152/46684 co-relation queries the response was YES. [2021-08-13 11:21:48,921 INFO L84 FinitePrefix]: Finished finitePrefix Result has 150584 conditions, 36456 events. 13473/36456 cut-off events. For 35152/46684 co-relation queries the response was YES. Maximal size of possible extension queue 2149. Compared 471014 event pairs, 457 based on Foata normal form. 320/36633 useless extension candidates. Maximal degree in co-relation 150490. Up to 17098 conditions per place. [2021-08-13 11:21:48,960 INFO L132 encePairwiseOnDemand]: 96/108 looper letters, 46 selfloop transitions, 17 changer transitions 1709/1842 dead transitions. [2021-08-13 11:21:48,960 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 1842 transitions, 26921 flow [2021-08-13 11:21:48,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-13 11:21:48,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-08-13 11:21:48,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1065 transitions. [2021-08-13 11:21:48,963 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8217592592592593 [2021-08-13 11:21:48,963 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1065 transitions. [2021-08-13 11:21:48,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1065 transitions. [2021-08-13 11:21:48,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:21:48,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1065 transitions. [2021-08-13 11:21:48,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 88.75) internal successors, (1065), 12 states have internal predecessors, (1065), 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-08-13 11:21:48,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 108.0) internal successors, (1404), 13 states have internal predecessors, (1404), 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-08-13 11:21:48,969 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 108.0) internal successors, (1404), 13 states have internal predecessors, (1404), 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-08-13 11:21:48,969 INFO L348 CegarLoopForPetriNet]: 113 programPoint places, 95 predicate places. [2021-08-13 11:21:48,969 INFO L482 AbstractCegarLoop]: Abstraction has has 208 places, 1842 transitions, 26921 flow [2021-08-13 11:21:48,970 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 82.8) internal successors, (828), 10 states have internal predecessors, (828), 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-08-13 11:21:48,970 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:21:48,970 INFO L266 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] [2021-08-13 11:21:48,970 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-13 11:21:48,970 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:21:48,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:21:48,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1718879582, now seen corresponding path program 1 times [2021-08-13 11:21:48,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:21:48,971 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703410941] [2021-08-13 11:21:48,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:21:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:21:49,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:49,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:21:49,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:49,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:21:49,260 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 11:21:49,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 11:21:49,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:49,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:21:49,282 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 11:21:49,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:21:49,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:49,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:21:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 11:21:49,293 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:21:49,294 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703410941] [2021-08-13 11:21:49,294 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703410941] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:21:49,296 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:21:49,296 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 11:21:49,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093263189] [2021-08-13 11:21:49,296 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 11:21:49,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:21:49,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 11:21:49,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 11:21:49,298 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 108 [2021-08-13 11:21:49,298 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 1842 transitions, 26921 flow. Second operand has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:21:49,298 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:21:49,298 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 108 [2021-08-13 11:21:49,299 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:21:53,354 INFO L129 PetriNetUnfolder]: 5005/16317 cut-off events. [2021-08-13 11:21:53,355 INFO L130 PetriNetUnfolder]: For 12729/16096 co-relation queries the response was YES. [2021-08-13 11:21:53,410 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59932 conditions, 16317 events. 5005/16317 cut-off events. For 12729/16096 co-relation queries the response was YES. Maximal size of possible extension queue 869. Compared 203214 event pairs, 367 based on Foata normal form. 47/15821 useless extension candidates. Maximal degree in co-relation 59835. Up to 6505 conditions per place. [2021-08-13 11:21:53,449 INFO L132 encePairwiseOnDemand]: 98/108 looper letters, 24 selfloop transitions, 17 changer transitions 568/1073 dead transitions. [2021-08-13 11:21:53,449 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 1073 transitions, 14651 flow [2021-08-13 11:21:53,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-13 11:21:53,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-13 11:21:53,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 983 transitions. [2021-08-13 11:21:53,451 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9101851851851852 [2021-08-13 11:21:53,451 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 983 transitions. [2021-08-13 11:21:53,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 983 transitions. [2021-08-13 11:21:53,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:21:53,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 983 transitions. [2021-08-13 11:21:53,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.3) internal successors, (983), 10 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:21:53,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 108.0) internal successors, (1188), 11 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:21:53,456 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 108.0) internal successors, (1188), 11 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:21:53,456 INFO L348 CegarLoopForPetriNet]: 113 programPoint places, 104 predicate places. [2021-08-13 11:21:53,456 INFO L482 AbstractCegarLoop]: Abstraction has has 217 places, 1073 transitions, 14651 flow [2021-08-13 11:21:53,456 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:21:53,457 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:21:53,457 INFO L266 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-08-13 11:21:53,457 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-13 11:21:53,457 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:21:53,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:21:53,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1658239253, now seen corresponding path program 1 times [2021-08-13 11:21:53,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:21:53,458 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061443745] [2021-08-13 11:21:53,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:21:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:21:53,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:53,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:21:53,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:53,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:21:53,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:53,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:21:53,529 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 11:21:53,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 11:21:53,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:53,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:21:53,554 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 11:21:53,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:21:53,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:53,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:21:53,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 11:21:53,564 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:21:53,564 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061443745] [2021-08-13 11:21:53,565 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061443745] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:21:53,565 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:21:53,565 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 11:21:53,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928080263] [2021-08-13 11:21:53,565 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 11:21:53,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:21:53,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 11:21:53,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 11:21:53,566 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 108 [2021-08-13 11:21:53,567 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 1073 transitions, 14651 flow. Second operand has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:21:53,567 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:21:53,567 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 108 [2021-08-13 11:21:53,567 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:21:54,855 INFO L129 PetriNetUnfolder]: 1449/4884 cut-off events. [2021-08-13 11:21:54,855 INFO L130 PetriNetUnfolder]: For 2573/7301 co-relation queries the response was YES. [2021-08-13 11:21:54,869 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15383 conditions, 4884 events. 1449/4884 cut-off events. For 2573/7301 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 51183 event pairs, 42 based on Foata normal form. 615/5158 useless extension candidates. Maximal degree in co-relation 15283. Up to 941 conditions per place. [2021-08-13 11:21:54,881 INFO L132 encePairwiseOnDemand]: 98/108 looper letters, 22 selfloop transitions, 44 changer transitions 228/428 dead transitions. [2021-08-13 11:21:54,881 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 428 transitions, 4623 flow [2021-08-13 11:21:54,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 11:21:54,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 11:21:54,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1279 transitions. [2021-08-13 11:21:54,883 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9109686609686609 [2021-08-13 11:21:54,884 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1279 transitions. [2021-08-13 11:21:54,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1279 transitions. [2021-08-13 11:21:54,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:21:54,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1279 transitions. [2021-08-13 11:21:54,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 98.38461538461539) internal successors, (1279), 13 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:21:54,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 108.0) internal successors, (1512), 14 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:21:54,888 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 108.0) internal successors, (1512), 14 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:21:54,889 INFO L348 CegarLoopForPetriNet]: 113 programPoint places, 101 predicate places. [2021-08-13 11:21:54,889 INFO L482 AbstractCegarLoop]: Abstraction has has 214 places, 428 transitions, 4623 flow [2021-08-13 11:21:54,889 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 95.14285714285714) internal successors, (666), 7 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:21:54,889 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:21:54,889 INFO L266 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] [2021-08-13 11:21:54,889 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-13 11:21:54,889 INFO L430 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:21:54,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:21:54,890 INFO L82 PathProgramCache]: Analyzing trace with hash 896524886, now seen corresponding path program 1 times [2021-08-13 11:21:54,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:21:54,890 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907631373] [2021-08-13 11:21:54,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:21:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:21:54,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:54,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:21:54,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:54,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:21:54,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:54,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:21:54,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:54,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:21:54,971 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 11:21:54,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 11:21:54,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:54,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:21:54,996 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 11:21:54,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:21:55,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:55,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:21:55,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 11:21:55,007 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:21:55,007 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907631373] [2021-08-13 11:21:55,007 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907631373] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:21:55,007 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:21:55,007 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-13 11:21:55,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289031438] [2021-08-13 11:21:55,007 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-13 11:21:55,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:21:55,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-13 11:21:55,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-13 11:21:55,009 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 108 [2021-08-13 11:21:55,009 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 428 transitions, 4623 flow. Second operand has 8 states, 8 states have (on average 95.125) internal successors, (761), 8 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:21:55,009 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:21:55,010 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 108 [2021-08-13 11:21:55,010 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:21:55,661 INFO L129 PetriNetUnfolder]: 1159/3540 cut-off events. [2021-08-13 11:21:55,661 INFO L130 PetriNetUnfolder]: For 2213/8856 co-relation queries the response was YES. [2021-08-13 11:21:55,683 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12014 conditions, 3540 events. 1159/3540 cut-off events. For 2213/8856 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 37354 event pairs, 12 based on Foata normal form. 703/3944 useless extension candidates. Maximal degree in co-relation 11911. Up to 846 conditions per place. [2021-08-13 11:21:55,698 INFO L132 encePairwiseOnDemand]: 98/108 looper letters, 19 selfloop transitions, 48 changer transitions 69/259 dead transitions. [2021-08-13 11:21:55,698 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 259 transitions, 2103 flow [2021-08-13 11:21:55,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 11:21:55,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 11:21:55,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1560 transitions. [2021-08-13 11:21:55,701 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9027777777777778 [2021-08-13 11:21:55,701 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1560 transitions. [2021-08-13 11:21:55,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1560 transitions. [2021-08-13 11:21:55,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:21:55,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1560 transitions. [2021-08-13 11:21:55,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 97.5) internal successors, (1560), 16 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:21:55,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 108.0) internal successors, (1836), 17 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:21:55,707 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 108.0) internal successors, (1836), 17 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:21:55,707 INFO L348 CegarLoopForPetriNet]: 113 programPoint places, 77 predicate places. [2021-08-13 11:21:55,707 INFO L482 AbstractCegarLoop]: Abstraction has has 190 places, 259 transitions, 2103 flow [2021-08-13 11:21:55,708 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 95.125) internal successors, (761), 8 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:21:55,708 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:21:55,708 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 11:21:55,708 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-13 11:21:55,708 INFO L430 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:21:55,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:21:55,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1621517481, now seen corresponding path program 1 times [2021-08-13 11:21:55,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:21:55,709 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109029668] [2021-08-13 11:21:55,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:21:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:21:55,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:55,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:21:55,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:55,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:21:55,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:55,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:21:55,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:55,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 11:21:55,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:55,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 11:21:55,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:55,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 11:21:55,929 INFO L142 QuantifierPusher]: treesize reduction 18, result has 82.2 percent of original size [2021-08-13 11:21:55,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 83 [2021-08-13 11:21:55,977 INFO L142 QuantifierPusher]: treesize reduction 21, result has 68.7 percent of original size [2021-08-13 11:21:55,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-08-13 11:21:56,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:56,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:21:56,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:56,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 11:21:56,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:56,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:21:56,041 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:21:56,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:21:56,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:56,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:21:56,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:56,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:21:56,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:56,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:21:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 11:21:56,094 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:21:56,095 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109029668] [2021-08-13 11:21:56,095 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109029668] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:21:56,095 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:21:56,095 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-13 11:21:56,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102614362] [2021-08-13 11:21:56,096 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-08-13 11:21:56,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:21:56,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-13 11:21:56,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2021-08-13 11:21:56,098 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 108 [2021-08-13 11:21:56,099 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 259 transitions, 2103 flow. Second operand has 15 states, 15 states have (on average 82.46666666666667) internal successors, (1237), 15 states have internal predecessors, (1237), 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-08-13 11:21:56,099 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:21:56,099 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 108 [2021-08-13 11:21:56,100 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:21:57,250 INFO L129 PetriNetUnfolder]: 2439/7165 cut-off events. [2021-08-13 11:21:57,251 INFO L130 PetriNetUnfolder]: For 4443/10370 co-relation queries the response was YES. [2021-08-13 11:21:57,289 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24884 conditions, 7165 events. 2439/7165 cut-off events. For 4443/10370 co-relation queries the response was YES. Maximal size of possible extension queue 1164. Compared 87270 event pairs, 4 based on Foata normal form. 77/6676 useless extension candidates. Maximal degree in co-relation 24772. Up to 1838 conditions per place. [2021-08-13 11:21:57,301 INFO L132 encePairwiseOnDemand]: 94/108 looper letters, 30 selfloop transitions, 22 changer transitions 179/357 dead transitions. [2021-08-13 11:21:57,301 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 357 transitions, 3743 flow [2021-08-13 11:21:57,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 11:21:57,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 11:21:57,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1370 transitions. [2021-08-13 11:21:57,304 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.7928240740740741 [2021-08-13 11:21:57,304 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1370 transitions. [2021-08-13 11:21:57,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1370 transitions. [2021-08-13 11:21:57,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:21:57,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1370 transitions. [2021-08-13 11:21:57,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 85.625) internal successors, (1370), 16 states have internal predecessors, (1370), 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-08-13 11:21:57,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 108.0) internal successors, (1836), 17 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:21:57,310 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 108.0) internal successors, (1836), 17 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:21:57,310 INFO L348 CegarLoopForPetriNet]: 113 programPoint places, 92 predicate places. [2021-08-13 11:21:57,310 INFO L482 AbstractCegarLoop]: Abstraction has has 205 places, 357 transitions, 3743 flow [2021-08-13 11:21:57,311 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 82.46666666666667) internal successors, (1237), 15 states have internal predecessors, (1237), 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-08-13 11:21:57,311 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:21:57,311 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 11:21:57,311 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-13 11:21:57,311 INFO L430 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:21:57,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:21:57,311 INFO L82 PathProgramCache]: Analyzing trace with hash -570796745, now seen corresponding path program 2 times [2021-08-13 11:21:57,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:21:57,312 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369057027] [2021-08-13 11:21:57,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:21:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:21:57,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:57,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:21:57,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:57,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:21:57,420 INFO L142 QuantifierPusher]: treesize reduction 9, result has 70.0 percent of original size [2021-08-13 11:21:57,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-08-13 11:21:57,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:57,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 11:21:57,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:57,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:21:57,446 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:21:57,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:21:57,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:57,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:21:57,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:57,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:21:57,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:57,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:21:57,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 11:21:57,483 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:21:57,483 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369057027] [2021-08-13 11:21:57,484 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369057027] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:21:57,484 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:21:57,484 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-13 11:21:57,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457911883] [2021-08-13 11:21:57,484 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-08-13 11:21:57,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:21:57,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-13 11:21:57,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-08-13 11:21:57,485 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 108 [2021-08-13 11:21:57,486 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 357 transitions, 3743 flow. Second operand has 9 states, 9 states have (on average 83.44444444444444) internal successors, (751), 9 states have internal predecessors, (751), 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-08-13 11:21:57,487 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:21:57,487 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 108 [2021-08-13 11:21:57,487 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:21:58,918 INFO L129 PetriNetUnfolder]: 4327/12295 cut-off events. [2021-08-13 11:21:58,919 INFO L130 PetriNetUnfolder]: For 7654/17309 co-relation queries the response was YES. [2021-08-13 11:21:59,004 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43072 conditions, 12295 events. 4327/12295 cut-off events. For 7654/17309 co-relation queries the response was YES. Maximal size of possible extension queue 2115. Compared 162626 event pairs, 0 based on Foata normal form. 69/11383 useless extension candidates. Maximal degree in co-relation 42951. Up to 3346 conditions per place. [2021-08-13 11:21:59,024 INFO L132 encePairwiseOnDemand]: 95/108 looper letters, 58 selfloop transitions, 22 changer transitions 227/433 dead transitions. [2021-08-13 11:21:59,024 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 433 transitions, 5423 flow [2021-08-13 11:21:59,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-13 11:21:59,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-13 11:21:59,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 864 transitions. [2021-08-13 11:21:59,026 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8 [2021-08-13 11:21:59,026 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 864 transitions. [2021-08-13 11:21:59,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 864 transitions. [2021-08-13 11:21:59,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:21:59,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 864 transitions. [2021-08-13 11:21:59,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 86.4) internal successors, (864), 10 states have internal predecessors, (864), 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-08-13 11:21:59,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 108.0) internal successors, (1188), 11 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:21:59,030 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 108.0) internal successors, (1188), 11 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:21:59,030 INFO L348 CegarLoopForPetriNet]: 113 programPoint places, 101 predicate places. [2021-08-13 11:21:59,030 INFO L482 AbstractCegarLoop]: Abstraction has has 214 places, 433 transitions, 5423 flow [2021-08-13 11:21:59,030 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 83.44444444444444) internal successors, (751), 9 states have internal predecessors, (751), 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-08-13 11:21:59,030 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:21:59,031 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 11:21:59,031 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-13 11:21:59,031 INFO L430 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:21:59,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:21:59,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1736613313, now seen corresponding path program 3 times [2021-08-13 11:21:59,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:21:59,031 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120529715] [2021-08-13 11:21:59,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:21:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:21:59,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:59,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:21:59,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:59,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:21:59,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:59,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:21:59,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:59,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 11:21:59,202 INFO L142 QuantifierPusher]: treesize reduction 11, result has 71.8 percent of original size [2021-08-13 11:21:59,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-08-13 11:21:59,209 INFO L142 QuantifierPusher]: treesize reduction 33, result has 61.6 percent of original size [2021-08-13 11:21:59,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-08-13 11:21:59,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:59,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-08-13 11:21:59,255 INFO L142 QuantifierPusher]: treesize reduction 6, result has 91.7 percent of original size [2021-08-13 11:21:59,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 66 [2021-08-13 11:21:59,264 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:21:59,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:21:59,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:59,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:21:59,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:59,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:21:59,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:21:59,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:21:59,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 11:21:59,313 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:21:59,313 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120529715] [2021-08-13 11:21:59,313 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120529715] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:21:59,313 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:21:59,313 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-13 11:21:59,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813570834] [2021-08-13 11:21:59,313 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-13 11:21:59,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:21:59,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-13 11:21:59,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-08-13 11:21:59,315 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 108 [2021-08-13 11:21:59,315 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 433 transitions, 5423 flow. Second operand has 10 states, 10 states have (on average 83.2) internal successors, (832), 10 states have internal predecessors, (832), 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-08-13 11:21:59,315 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:21:59,315 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 108 [2021-08-13 11:21:59,316 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:22:00,995 INFO L129 PetriNetUnfolder]: 4811/13813 cut-off events. [2021-08-13 11:22:00,996 INFO L130 PetriNetUnfolder]: For 9536/22523 co-relation queries the response was YES. [2021-08-13 11:22:01,066 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49104 conditions, 13813 events. 4811/13813 cut-off events. For 9536/22523 co-relation queries the response was YES. Maximal size of possible extension queue 2373. Compared 187052 event pairs, 0 based on Foata normal form. 79/12784 useless extension candidates. Maximal degree in co-relation 48974. Up to 3730 conditions per place. [2021-08-13 11:22:01,085 INFO L132 encePairwiseOnDemand]: 95/108 looper letters, 53 selfloop transitions, 24 changer transitions 266/469 dead transitions. [2021-08-13 11:22:01,086 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 469 transitions, 6673 flow [2021-08-13 11:22:01,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 11:22:01,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 11:22:01,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 772 transitions. [2021-08-13 11:22:01,088 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.7942386831275721 [2021-08-13 11:22:01,088 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 772 transitions. [2021-08-13 11:22:01,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 772 transitions. [2021-08-13 11:22:01,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:22:01,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 772 transitions. [2021-08-13 11:22:01,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 85.77777777777777) internal successors, (772), 9 states have internal predecessors, (772), 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-08-13 11:22:01,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 108.0) internal successors, (1080), 10 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:22:01,091 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 108.0) internal successors, (1080), 10 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:22:01,091 INFO L348 CegarLoopForPetriNet]: 113 programPoint places, 109 predicate places. [2021-08-13 11:22:01,091 INFO L482 AbstractCegarLoop]: Abstraction has has 222 places, 469 transitions, 6673 flow [2021-08-13 11:22:01,091 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 83.2) internal successors, (832), 10 states have internal predecessors, (832), 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-08-13 11:22:01,091 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:22:01,092 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 11:22:01,092 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-13 11:22:01,092 INFO L430 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:22:01,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:22:01,092 INFO L82 PathProgramCache]: Analyzing trace with hash -85364913, now seen corresponding path program 4 times [2021-08-13 11:22:01,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:22:01,092 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39048163] [2021-08-13 11:22:01,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:22:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:22:01,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:22:01,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:22:01,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:22:01,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:22:01,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:22:01,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:22:01,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:22:01,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 11:22:01,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:22:01,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 11:22:01,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:22:01,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 11:22:01,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:22:01,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-08-13 11:22:01,271 INFO L142 QuantifierPusher]: treesize reduction 26, result has 61.2 percent of original size [2021-08-13 11:22:01,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-08-13 11:22:01,303 INFO L142 QuantifierPusher]: treesize reduction 65, result has 52.6 percent of original size [2021-08-13 11:22:01,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 72 [2021-08-13 11:22:01,357 INFO L142 QuantifierPusher]: treesize reduction 34, result has 63.4 percent of original size [2021-08-13 11:22:01,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 59 [2021-08-13 11:22:01,410 INFO L142 QuantifierPusher]: treesize reduction 4, result has 73.3 percent of original size [2021-08-13 11:22:01,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-08-13 11:22:01,424 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-08-13 11:22:01,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-08-13 11:22:01,436 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:22:01,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:22:01,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:22:01,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:22:01,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:22:01,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:22:01,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:22:01,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:22:01,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 11:22:01,494 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:22:01,494 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39048163] [2021-08-13 11:22:01,494 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39048163] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:22:01,494 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:22:01,494 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-08-13 11:22:01,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705730561] [2021-08-13 11:22:01,495 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-08-13 11:22:01,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:22:01,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-13 11:22:01,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2021-08-13 11:22:01,497 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 108 [2021-08-13 11:22:01,498 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 469 transitions, 6673 flow. Second operand has 16 states, 16 states have (on average 79.5625) internal successors, (1273), 16 states have internal predecessors, (1273), 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-08-13 11:22:01,498 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:22:01,498 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 108 [2021-08-13 11:22:01,498 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:22:05,030 INFO L129 PetriNetUnfolder]: 7728/21549 cut-off events. [2021-08-13 11:22:05,030 INFO L130 PetriNetUnfolder]: For 14304/33450 co-relation queries the response was YES. [2021-08-13 11:22:05,146 INFO L84 FinitePrefix]: Finished finitePrefix Result has 76343 conditions, 21549 events. 7728/21549 cut-off events. For 14304/33450 co-relation queries the response was YES. Maximal size of possible extension queue 3673. Compared 307210 event pairs, 0 based on Foata normal form. 161/19993 useless extension candidates. Maximal degree in co-relation 76201. Up to 6083 conditions per place. [2021-08-13 11:22:05,165 INFO L132 encePairwiseOnDemand]: 93/108 looper letters, 36 selfloop transitions, 14 changer transitions 381/553 dead transitions. [2021-08-13 11:22:05,165 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 553 transitions, 9047 flow [2021-08-13 11:22:05,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-13 11:22:05,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-08-13 11:22:05,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1809 transitions. [2021-08-13 11:22:05,170 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.7613636363636364 [2021-08-13 11:22:05,170 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1809 transitions. [2021-08-13 11:22:05,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1809 transitions. [2021-08-13 11:22:05,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:22:05,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1809 transitions. [2021-08-13 11:22:05,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 82.22727272727273) internal successors, (1809), 22 states have internal predecessors, (1809), 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-08-13 11:22:05,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 108.0) internal successors, (2484), 23 states have internal predecessors, (2484), 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-08-13 11:22:05,177 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 108.0) internal successors, (2484), 23 states have internal predecessors, (2484), 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-08-13 11:22:05,177 INFO L348 CegarLoopForPetriNet]: 113 programPoint places, 130 predicate places. [2021-08-13 11:22:05,177 INFO L482 AbstractCegarLoop]: Abstraction has has 243 places, 553 transitions, 9047 flow [2021-08-13 11:22:05,178 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 79.5625) internal successors, (1273), 16 states have internal predecessors, (1273), 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-08-13 11:22:05,178 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:22:05,178 INFO L266 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 11:22:05,178 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-13 11:22:05,178 INFO L430 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:22:05,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:22:05,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1644398289, now seen corresponding path program 5 times [2021-08-13 11:22:05,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:22:05,179 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612900824] [2021-08-13 11:22:05,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:22:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 11:22:05,255 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 11:22:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 11:22:05,324 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 11:22:05,377 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-13 11:22:05,378 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-13 11:22:05,379 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-13 11:22:05,382 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-13 11:22:05,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.08 11:22:05 BasicIcfg [2021-08-13 11:22:05,546 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-13 11:22:05,547 INFO L168 Benchmark]: Toolchain (without parser) took 43329.36 ms. Allocated memory was 195.0 MB in the beginning and 4.2 GB in the end (delta: 4.1 GB). Free memory was 157.4 MB in the beginning and 2.8 GB in the end (delta: -2.7 GB). Peak memory consumption was 1.4 GB. Max. memory is 8.0 GB. [2021-08-13 11:22:05,547 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 195.0 MB. Free memory was 175.8 MB in the beginning and 175.7 MB in the end (delta: 88.7 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-08-13 11:22:05,547 INFO L168 Benchmark]: CACSL2BoogieTranslator took 592.46 ms. Allocated memory is still 195.0 MB. Free memory was 157.2 MB in the beginning and 148.6 MB in the end (delta: 8.6 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2021-08-13 11:22:05,547 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.86 ms. Allocated memory is still 195.0 MB. Free memory was 148.6 MB in the beginning and 145.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-13 11:22:05,547 INFO L168 Benchmark]: Boogie Preprocessor took 69.32 ms. Allocated memory is still 195.0 MB. Free memory was 145.5 MB in the beginning and 142.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-13 11:22:05,548 INFO L168 Benchmark]: RCFGBuilder took 3252.51 ms. Allocated memory was 195.0 MB in the beginning and 234.9 MB in the end (delta: 39.8 MB). Free memory was 142.4 MB in the beginning and 188.1 MB in the end (delta: -45.7 MB). Peak memory consumption was 112.1 MB. Max. memory is 8.0 GB. [2021-08-13 11:22:05,548 INFO L168 Benchmark]: TraceAbstraction took 39359.57 ms. Allocated memory was 234.9 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 187.5 MB in the beginning and 2.8 GB in the end (delta: -2.7 GB). Peak memory consumption was 1.4 GB. Max. memory is 8.0 GB. [2021-08-13 11:22:05,548 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.12 ms. Allocated memory is still 195.0 MB. Free memory was 175.8 MB in the beginning and 175.7 MB in the end (delta: 88.7 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 592.46 ms. Allocated memory is still 195.0 MB. Free memory was 157.2 MB in the beginning and 148.6 MB in the end (delta: 8.6 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 48.86 ms. Allocated memory is still 195.0 MB. Free memory was 148.6 MB in the beginning and 145.5 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 69.32 ms. Allocated memory is still 195.0 MB. Free memory was 145.5 MB in the beginning and 142.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 3252.51 ms. Allocated memory was 195.0 MB in the beginning and 234.9 MB in the end (delta: 39.8 MB). Free memory was 142.4 MB in the beginning and 188.1 MB in the end (delta: -45.7 MB). Peak memory consumption was 112.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 39359.57 ms. Allocated memory was 234.9 MB in the beginning and 4.2 GB in the end (delta: 4.0 GB). Free memory was 187.5 MB in the beginning and 2.8 GB in the end (delta: -2.7 GB). Peak memory consumption was 1.4 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L722] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L723] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L724] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L725] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L726] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L727] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L728] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L729] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L730] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L731] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L732] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L733] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L734] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L735] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L736] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L737] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L738] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L854] 0 pthread_t t2333; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L855] FCALL, FORK 0 pthread_create(&t2333, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t2334; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L857] FCALL, FORK 0 pthread_create(&t2334, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L858] 0 pthread_t t2335; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L859] FCALL, FORK 0 pthread_create(&t2335, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L813] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L821] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L821] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L822] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L822] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L823] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L823] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L824] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L825] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L825] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L826] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L833] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L834] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L835] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L836] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L744] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0) [L759] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L760] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used) [L761] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L762] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1) [L763] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L764] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L770] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L877] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L878] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L879] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L880] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L881] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L882] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L19] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L19] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 136 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 10.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 39060.9ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 34729.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 49.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 217 SDtfs, 709 SDslu, 934 SDs, 0 SdLazy, 2541 SolverSat, 712 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3113.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 266 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 3712.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=26921occurred in iteration=8, InterpolantAutomatonStates: 201, 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: 100.6ms SsaConstructionTime, 930.8ms SatisfiabilityAnalysisTime, 2710.8ms InterpolantComputationTime, 1226 NumberOfCodeBlocks, 1226 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1127 ConstructedInterpolants, 0 QuantifiedInterpolants, 6975 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...