/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi004.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 04:56:45,826 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 04:56:45,829 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 04:56:45,888 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 04:56:45,889 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 04:56:45,897 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 04:56:45,898 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 04:56:45,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 04:56:45,909 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 04:56:45,912 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 04:56:45,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 04:56:45,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 04:56:45,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 04:56:45,915 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 04:56:45,916 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 04:56:45,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 04:56:45,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 04:56:45,918 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 04:56:45,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 04:56:45,920 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 04:56:45,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 04:56:45,924 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 04:56:45,927 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 04:56:45,928 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 04:56:45,938 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 04:56:45,938 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 04:56:45,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 04:56:45,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 04:56:45,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 04:56:45,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 04:56:45,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 04:56:45,942 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 04:56:45,944 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 04:56:45,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 04:56:45,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 04:56:45,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 04:56:45,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 04:56:45,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 04:56:45,946 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 04:56:45,947 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 04:56:45,947 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 04:56:45,948 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-Before.epf [2022-01-19 04:56:45,977 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 04:56:45,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 04:56:45,978 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 04:56:45,978 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 04:56:45,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 04:56:45,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 04:56:45,979 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 04:56:45,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 04:56:45,979 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 04:56:45,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 04:56:45,980 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 04:56:45,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 04:56:45,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 04:56:45,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 04:56:45,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 04:56:45,980 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 04:56:45,980 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 04:56:45,980 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 04:56:45,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 04:56:45,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 04:56:45,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 04:56:45,981 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 04:56:45,981 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 04:56:45,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:56:45,981 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 04:56:45,981 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 04:56:45,982 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 04:56:45,983 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 04:56:45,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 04:56:45,983 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 04:56:45,983 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 04:56:45,983 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 04:56:45,983 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 [2022-01-19 04:56:46,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 04:56:46,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 04:56:46,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 04:56:46,195 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 04:56:46,196 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 04:56:46,197 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004.i [2022-01-19 04:56:46,251 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb64e88da/9e267d8552684d81a0b81c60e1cabd5b/FLAG352f158af [2022-01-19 04:56:46,738 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 04:56:46,739 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004.i [2022-01-19 04:56:46,755 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb64e88da/9e267d8552684d81a0b81c60e1cabd5b/FLAG352f158af [2022-01-19 04:56:47,236 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb64e88da/9e267d8552684d81a0b81c60e1cabd5b [2022-01-19 04:56:47,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 04:56:47,239 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 04:56:47,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 04:56:47,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 04:56:47,244 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 04:56:47,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:56:47" (1/1) ... [2022-01-19 04:56:47,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e17b7a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:56:47, skipping insertion in model container [2022-01-19 04:56:47,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:56:47" (1/1) ... [2022-01-19 04:56:47,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 04:56:47,283 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 04:56:47,456 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004.i[983,996] [2022-01-19 04:56:47,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:56:47,655 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 04:56:47,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004.i[983,996] [2022-01-19 04:56:47,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:56:47,758 INFO L208 MainTranslator]: Completed translation [2022-01-19 04:56:47,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:56:47 WrapperNode [2022-01-19 04:56:47,759 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 04:56:47,760 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 04:56:47,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 04:56:47,760 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 04:56:47,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:56:47" (1/1) ... [2022-01-19 04:56:47,801 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:56:47" (1/1) ... [2022-01-19 04:56:47,834 INFO L137 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 169 [2022-01-19 04:56:47,835 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 04:56:47,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 04:56:47,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 04:56:47,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 04:56:47,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:56:47" (1/1) ... [2022-01-19 04:56:47,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:56:47" (1/1) ... [2022-01-19 04:56:47,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:56:47" (1/1) ... [2022-01-19 04:56:47,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:56:47" (1/1) ... [2022-01-19 04:56:47,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:56:47" (1/1) ... [2022-01-19 04:56:47,869 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:56:47" (1/1) ... [2022-01-19 04:56:47,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:56:47" (1/1) ... [2022-01-19 04:56:47,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 04:56:47,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 04:56:47,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 04:56:47,895 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 04:56:47,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:56:47" (1/1) ... [2022-01-19 04:56:47,902 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:56:47,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:56:47,920 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 04:56:47,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 04:56:47,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 04:56:47,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 04:56:47,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 04:56:47,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 04:56:47,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 04:56:47,948 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-19 04:56:47,949 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-19 04:56:47,949 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-19 04:56:47,949 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-19 04:56:47,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 04:56:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 04:56:47,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 04:56:47,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 04:56:47,955 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 04:56:48,115 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 04:56:48,117 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 04:56:48,528 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 04:56:48,777 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 04:56:48,777 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 04:56:48,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:56:48 BoogieIcfgContainer [2022-01-19 04:56:48,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 04:56:48,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 04:56:48,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 04:56:48,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 04:56:48,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 04:56:47" (1/3) ... [2022-01-19 04:56:48,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c954a0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:56:48, skipping insertion in model container [2022-01-19 04:56:48,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:56:47" (2/3) ... [2022-01-19 04:56:48,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c954a0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:56:48, skipping insertion in model container [2022-01-19 04:56:48,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:56:48" (3/3) ... [2022-01-19 04:56:48,787 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi004.i [2022-01-19 04:56:48,792 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 04:56:48,792 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 04:56:48,793 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 04:56:48,833 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,833 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,833 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,834 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,834 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,834 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,834 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,834 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,834 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,835 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,835 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,835 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,835 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,835 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,836 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,836 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,836 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,836 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,836 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,836 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,837 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,837 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,837 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,837 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,837 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,838 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,838 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,838 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,838 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,838 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,838 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,839 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,839 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,839 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,839 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,839 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,839 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,839 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,839 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,840 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,840 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,840 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,840 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,840 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,840 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,840 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,843 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,843 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,843 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,843 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,844 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,844 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,844 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,844 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,844 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,844 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,844 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,844 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,845 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,845 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,845 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,845 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,845 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,845 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,845 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,845 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,845 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,846 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,846 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,846 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,846 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,846 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,846 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,846 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,847 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,847 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,847 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,847 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,847 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,847 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,847 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,847 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,848 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,848 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,850 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,851 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,851 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,851 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,852 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,853 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,853 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,854 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,854 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,856 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,861 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,861 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,861 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,861 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,862 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,862 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,862 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,862 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,862 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,862 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,863 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,864 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,864 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,864 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,864 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,864 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,864 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,864 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,865 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,865 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,865 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,865 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,865 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,865 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,866 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,866 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,866 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,866 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,869 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,870 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,870 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,870 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,870 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,871 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,871 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,871 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,871 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,871 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,872 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,872 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,872 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,872 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,872 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,872 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,872 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,872 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,873 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,873 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,873 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,873 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,873 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,873 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,874 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,874 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,874 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,875 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,875 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,875 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,875 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,875 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,875 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,876 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,876 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,876 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,877 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,877 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,877 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:56:48,878 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 04:56:48,925 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 04:56:48,929 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 04:56:48,929 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-19 04:56:48,938 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 98 transitions, 206 flow [2022-01-19 04:56:48,970 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2022-01-19 04:56:48,971 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:56:48,973 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-01-19 04:56:48,973 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 98 transitions, 206 flow [2022-01-19 04:56:48,977 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 96 transitions, 198 flow [2022-01-19 04:56:48,988 INFO L129 PetriNetUnfolder]: 0/59 cut-off events. [2022-01-19 04:56:48,988 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:56:48,988 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:56:48,989 INFO L254 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] [2022-01-19 04:56:48,989 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-19 04:56:48,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:56:48,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1407643271, now seen corresponding path program 1 times [2022-01-19 04:56:49,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:56:49,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273393946] [2022-01-19 04:56:49,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:56:49,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:56:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:56:49,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:56:49,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:56:49,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273393946] [2022-01-19 04:56:49,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273393946] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:56:49,279 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:56:49,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 04:56:49,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562901687] [2022-01-19 04:56:49,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:56:49,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 04:56:49,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:56:49,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 04:56:49,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 04:56:49,320 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 98 [2022-01-19 04:56:49,326 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 96 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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) [2022-01-19 04:56:49,326 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:56:49,326 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 98 [2022-01-19 04:56:49,327 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:56:49,444 INFO L129 PetriNetUnfolder]: 10/162 cut-off events. [2022-01-19 04:56:49,444 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 04:56:49,446 INFO L84 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 162 events. 10/162 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 338 event pairs, 4 based on Foata normal form. 6/159 useless extension candidates. Maximal degree in co-relation 147. Up to 17 conditions per place. [2022-01-19 04:56:49,448 INFO L132 encePairwiseOnDemand]: 93/98 looper letters, 7 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2022-01-19 04:56:49,448 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 94 transitions, 212 flow [2022-01-19 04:56:49,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 04:56:49,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 04:56:49,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2022-01-19 04:56:49,465 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.935374149659864 [2022-01-19 04:56:49,466 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 275 transitions. [2022-01-19 04:56:49,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 275 transitions. [2022-01-19 04:56:49,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:56:49,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 275 transitions. [2022-01-19 04:56:49,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:56:49,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 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) [2022-01-19 04:56:49,485 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 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) [2022-01-19 04:56:49,487 INFO L186 Difference]: Start difference. First operand has 101 places, 96 transitions, 198 flow. Second operand 3 states and 275 transitions. [2022-01-19 04:56:49,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 94 transitions, 212 flow [2022-01-19 04:56:49,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 94 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 04:56:49,498 INFO L242 Difference]: Finished difference. Result has 99 places, 92 transitions, 192 flow [2022-01-19 04:56:49,502 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=99, PETRI_TRANSITIONS=92} [2022-01-19 04:56:49,507 INFO L334 CegarLoopForPetriNet]: 101 programPoint places, -2 predicate places. [2022-01-19 04:56:49,507 INFO L470 AbstractCegarLoop]: Abstraction has has 99 places, 92 transitions, 192 flow [2022-01-19 04:56:49,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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) [2022-01-19 04:56:49,508 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:56:49,508 INFO L254 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] [2022-01-19 04:56:49,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 04:56:49,509 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-19 04:56:49,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:56:49,509 INFO L85 PathProgramCache]: Analyzing trace with hash 434890909, now seen corresponding path program 1 times [2022-01-19 04:56:49,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:56:49,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61970072] [2022-01-19 04:56:49,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:56:49,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:56:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:56:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:56:49,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:56:49,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61970072] [2022-01-19 04:56:49,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61970072] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:56:49,742 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:56:49,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:56:49,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746195520] [2022-01-19 04:56:49,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:56:49,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:56:49,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:56:49,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:56:49,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:56:49,745 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 98 [2022-01-19 04:56:49,746 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 92 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 80.66666666666667) internal successors, (484), 6 states have internal predecessors, (484), 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) [2022-01-19 04:56:49,746 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:56:49,746 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 98 [2022-01-19 04:56:49,746 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:56:50,004 INFO L129 PetriNetUnfolder]: 84/381 cut-off events. [2022-01-19 04:56:50,004 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-01-19 04:56:50,006 INFO L84 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 381 events. 84/381 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1817 event pairs, 18 based on Foata normal form. 0/369 useless extension candidates. Maximal degree in co-relation 522. Up to 65 conditions per place. [2022-01-19 04:56:50,007 INFO L132 encePairwiseOnDemand]: 92/98 looper letters, 14 selfloop transitions, 2 changer transitions 34/118 dead transitions. [2022-01-19 04:56:50,007 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 118 transitions, 332 flow [2022-01-19 04:56:50,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 04:56:50,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 04:56:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 754 transitions. [2022-01-19 04:56:50,010 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.854875283446712 [2022-01-19 04:56:50,010 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 754 transitions. [2022-01-19 04:56:50,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 754 transitions. [2022-01-19 04:56:50,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:56:50,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 754 transitions. [2022-01-19 04:56:50,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 83.77777777777777) internal successors, (754), 9 states have internal predecessors, (754), 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) [2022-01-19 04:56:50,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:56:50,015 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:56:50,016 INFO L186 Difference]: Start difference. First operand has 99 places, 92 transitions, 192 flow. Second operand 9 states and 754 transitions. [2022-01-19 04:56:50,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 118 transitions, 332 flow [2022-01-19 04:56:50,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 118 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 04:56:50,019 INFO L242 Difference]: Finished difference. Result has 112 places, 82 transitions, 188 flow [2022-01-19 04:56:50,019 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=188, PETRI_PLACES=112, PETRI_TRANSITIONS=82} [2022-01-19 04:56:50,020 INFO L334 CegarLoopForPetriNet]: 101 programPoint places, 11 predicate places. [2022-01-19 04:56:50,020 INFO L470 AbstractCegarLoop]: Abstraction has has 112 places, 82 transitions, 188 flow [2022-01-19 04:56:50,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.66666666666667) internal successors, (484), 6 states have internal predecessors, (484), 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) [2022-01-19 04:56:50,020 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:56:50,021 INFO L254 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] [2022-01-19 04:56:50,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 04:56:50,021 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-19 04:56:50,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:56:50,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1273998362, now seen corresponding path program 1 times [2022-01-19 04:56:50,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:56:50,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881376744] [2022-01-19 04:56:50,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:56:50,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:56:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:56:50,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:56:50,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:56:50,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881376744] [2022-01-19 04:56:50,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881376744] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:56:50,118 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:56:50,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:56:50,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104842819] [2022-01-19 04:56:50,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:56:50,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:56:50,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:56:50,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:56:50,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:56:50,121 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 98 [2022-01-19 04:56:50,121 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 82 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 79.83333333333333) internal successors, (479), 6 states have internal predecessors, (479), 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) [2022-01-19 04:56:50,122 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:56:50,122 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 98 [2022-01-19 04:56:50,122 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:56:50,372 INFO L129 PetriNetUnfolder]: 122/390 cut-off events. [2022-01-19 04:56:50,372 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-01-19 04:56:50,373 INFO L84 FinitePrefix]: Finished finitePrefix Result has 691 conditions, 390 events. 122/390 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1790 event pairs, 10 based on Foata normal form. 0/382 useless extension candidates. Maximal degree in co-relation 661. Up to 67 conditions per place. [2022-01-19 04:56:50,375 INFO L132 encePairwiseOnDemand]: 89/98 looper letters, 21 selfloop transitions, 5 changer transitions 35/127 dead transitions. [2022-01-19 04:56:50,375 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 127 transitions, 402 flow [2022-01-19 04:56:50,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 04:56:50,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 04:56:50,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 843 transitions. [2022-01-19 04:56:50,377 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.860204081632653 [2022-01-19 04:56:50,377 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 843 transitions. [2022-01-19 04:56:50,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 843 transitions. [2022-01-19 04:56:50,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:56:50,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 843 transitions. [2022-01-19 04:56:50,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 84.3) internal successors, (843), 10 states have internal predecessors, (843), 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) [2022-01-19 04:56:50,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 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) [2022-01-19 04:56:50,382 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 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) [2022-01-19 04:56:50,382 INFO L186 Difference]: Start difference. First operand has 112 places, 82 transitions, 188 flow. Second operand 10 states and 843 transitions. [2022-01-19 04:56:50,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 127 transitions, 402 flow [2022-01-19 04:56:50,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 127 transitions, 386 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-01-19 04:56:50,386 INFO L242 Difference]: Finished difference. Result has 103 places, 83 transitions, 214 flow [2022-01-19 04:56:50,386 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=214, PETRI_PLACES=103, PETRI_TRANSITIONS=83} [2022-01-19 04:56:50,387 INFO L334 CegarLoopForPetriNet]: 101 programPoint places, 2 predicate places. [2022-01-19 04:56:50,387 INFO L470 AbstractCegarLoop]: Abstraction has has 103 places, 83 transitions, 214 flow [2022-01-19 04:56:50,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.83333333333333) internal successors, (479), 6 states have internal predecessors, (479), 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) [2022-01-19 04:56:50,387 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:56:50,388 INFO L254 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] [2022-01-19 04:56:50,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 04:56:50,388 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-19 04:56:50,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:56:50,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1742874355, now seen corresponding path program 1 times [2022-01-19 04:56:50,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:56:50,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811279651] [2022-01-19 04:56:50,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:56:50,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:56:50,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:56:50,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:56:50,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:56:50,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811279651] [2022-01-19 04:56:50,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811279651] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:56:50,545 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:56:50,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:56:50,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381806472] [2022-01-19 04:56:50,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:56:50,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:56:50,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:56:50,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:56:50,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:56:50,552 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 98 [2022-01-19 04:56:50,552 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 83 transitions, 214 flow. Second operand has 7 states, 7 states have (on average 79.85714285714286) internal successors, (559), 7 states have internal predecessors, (559), 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) [2022-01-19 04:56:50,553 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:56:50,553 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 98 [2022-01-19 04:56:50,553 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:56:50,736 INFO L129 PetriNetUnfolder]: 27/163 cut-off events. [2022-01-19 04:56:50,737 INFO L130 PetriNetUnfolder]: For 88/88 co-relation queries the response was YES. [2022-01-19 04:56:50,737 INFO L84 FinitePrefix]: Finished finitePrefix Result has 343 conditions, 163 events. 27/163 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 394 event pairs, 3 based on Foata normal form. 6/167 useless extension candidates. Maximal degree in co-relation 318. Up to 24 conditions per place. [2022-01-19 04:56:50,738 INFO L132 encePairwiseOnDemand]: 90/98 looper letters, 14 selfloop transitions, 7 changer transitions 17/104 dead transitions. [2022-01-19 04:56:50,738 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 104 transitions, 377 flow [2022-01-19 04:56:50,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 04:56:50,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 04:56:50,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 820 transitions. [2022-01-19 04:56:50,741 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8367346938775511 [2022-01-19 04:56:50,741 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 820 transitions. [2022-01-19 04:56:50,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 820 transitions. [2022-01-19 04:56:50,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:56:50,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 820 transitions. [2022-01-19 04:56:50,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 82.0) internal successors, (820), 10 states have internal predecessors, (820), 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) [2022-01-19 04:56:50,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 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) [2022-01-19 04:56:50,746 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 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) [2022-01-19 04:56:50,746 INFO L186 Difference]: Start difference. First operand has 103 places, 83 transitions, 214 flow. Second operand 10 states and 820 transitions. [2022-01-19 04:56:50,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 104 transitions, 377 flow [2022-01-19 04:56:50,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 104 transitions, 338 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-01-19 04:56:50,751 INFO L242 Difference]: Finished difference. Result has 106 places, 83 transitions, 226 flow [2022-01-19 04:56:50,751 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=226, PETRI_PLACES=106, PETRI_TRANSITIONS=83} [2022-01-19 04:56:50,752 INFO L334 CegarLoopForPetriNet]: 101 programPoint places, 5 predicate places. [2022-01-19 04:56:50,753 INFO L470 AbstractCegarLoop]: Abstraction has has 106 places, 83 transitions, 226 flow [2022-01-19 04:56:50,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.85714285714286) internal successors, (559), 7 states have internal predecessors, (559), 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) [2022-01-19 04:56:50,753 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:56:50,753 INFO L254 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] [2022-01-19 04:56:50,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 04:56:50,754 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-19 04:56:50,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:56:50,754 INFO L85 PathProgramCache]: Analyzing trace with hash -616385355, now seen corresponding path program 1 times [2022-01-19 04:56:50,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:56:50,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683695825] [2022-01-19 04:56:50,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:56:50,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:56:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:56:51,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:56:51,056 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:56:51,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683695825] [2022-01-19 04:56:51,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683695825] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:56:51,057 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:56:51,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 04:56:51,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249438553] [2022-01-19 04:56:51,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:56:51,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 04:56:51,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:56:51,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 04:56:51,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-19 04:56:51,059 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 98 [2022-01-19 04:56:51,059 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 83 transitions, 226 flow. Second operand has 9 states, 9 states have (on average 76.11111111111111) internal successors, (685), 9 states have internal predecessors, (685), 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) [2022-01-19 04:56:51,059 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:56:51,059 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 98 [2022-01-19 04:56:51,060 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:56:51,201 INFO L129 PetriNetUnfolder]: 4/120 cut-off events. [2022-01-19 04:56:51,202 INFO L130 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2022-01-19 04:56:51,202 INFO L84 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 120 events. 4/120 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 130 event pairs, 1 based on Foata normal form. 1/120 useless extension candidates. Maximal degree in co-relation 177. Up to 16 conditions per place. [2022-01-19 04:56:51,202 INFO L132 encePairwiseOnDemand]: 89/98 looper letters, 16 selfloop transitions, 4 changer transitions 6/90 dead transitions. [2022-01-19 04:56:51,203 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 90 transitions, 292 flow [2022-01-19 04:56:51,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 04:56:51,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 04:56:51,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 767 transitions. [2022-01-19 04:56:51,205 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7826530612244897 [2022-01-19 04:56:51,205 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 767 transitions. [2022-01-19 04:56:51,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 767 transitions. [2022-01-19 04:56:51,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:56:51,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 767 transitions. [2022-01-19 04:56:51,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 76.7) internal successors, (767), 10 states have internal predecessors, (767), 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) [2022-01-19 04:56:51,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 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) [2022-01-19 04:56:51,209 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 98.0) internal successors, (1078), 11 states have internal predecessors, (1078), 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) [2022-01-19 04:56:51,209 INFO L186 Difference]: Start difference. First operand has 106 places, 83 transitions, 226 flow. Second operand 10 states and 767 transitions. [2022-01-19 04:56:51,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 90 transitions, 292 flow [2022-01-19 04:56:51,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 90 transitions, 246 flow, removed 13 selfloop flow, removed 13 redundant places. [2022-01-19 04:56:51,211 INFO L242 Difference]: Finished difference. Result has 103 places, 83 transitions, 200 flow [2022-01-19 04:56:51,212 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=200, PETRI_PLACES=103, PETRI_TRANSITIONS=83} [2022-01-19 04:56:51,212 INFO L334 CegarLoopForPetriNet]: 101 programPoint places, 2 predicate places. [2022-01-19 04:56:51,212 INFO L470 AbstractCegarLoop]: Abstraction has has 103 places, 83 transitions, 200 flow [2022-01-19 04:56:51,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 76.11111111111111) internal successors, (685), 9 states have internal predecessors, (685), 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) [2022-01-19 04:56:51,213 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:56:51,213 INFO L254 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] [2022-01-19 04:56:51,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 04:56:51,213 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-19 04:56:51,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:56:51,214 INFO L85 PathProgramCache]: Analyzing trace with hash -478358125, now seen corresponding path program 2 times [2022-01-19 04:56:51,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:56:51,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598483295] [2022-01-19 04:56:51,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:56:51,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:56:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:56:51,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:56:51,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:56:51,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598483295] [2022-01-19 04:56:51,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598483295] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:56:51,337 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:56:51,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 04:56:51,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975750844] [2022-01-19 04:56:51,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:56:51,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 04:56:51,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:56:51,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 04:56:51,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 04:56:51,339 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 98 [2022-01-19 04:56:51,339 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 83 transitions, 200 flow. Second operand has 7 states, 7 states have (on average 79.28571428571429) internal successors, (555), 7 states have internal predecessors, (555), 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) [2022-01-19 04:56:51,339 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:56:51,339 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 98 [2022-01-19 04:56:51,339 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:56:51,463 INFO L129 PetriNetUnfolder]: 8/138 cut-off events. [2022-01-19 04:56:51,464 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-01-19 04:56:51,464 INFO L84 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 138 events. 8/138 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 235 event pairs, 0 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 219. Up to 21 conditions per place. [2022-01-19 04:56:51,464 INFO L132 encePairwiseOnDemand]: 92/98 looper letters, 15 selfloop transitions, 1 changer transitions 11/94 dead transitions. [2022-01-19 04:56:51,465 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 94 transitions, 297 flow [2022-01-19 04:56:51,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 04:56:51,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 04:56:51,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 567 transitions. [2022-01-19 04:56:51,466 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.826530612244898 [2022-01-19 04:56:51,466 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 567 transitions. [2022-01-19 04:56:51,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 567 transitions. [2022-01-19 04:56:51,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:56:51,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 567 transitions. [2022-01-19 04:56:51,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 81.0) internal successors, (567), 7 states have internal predecessors, (567), 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) [2022-01-19 04:56:51,469 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 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) [2022-01-19 04:56:51,469 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 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) [2022-01-19 04:56:51,469 INFO L186 Difference]: Start difference. First operand has 103 places, 83 transitions, 200 flow. Second operand 7 states and 567 transitions. [2022-01-19 04:56:51,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 94 transitions, 297 flow [2022-01-19 04:56:51,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 94 transitions, 267 flow, removed 7 selfloop flow, removed 8 redundant places. [2022-01-19 04:56:51,472 INFO L242 Difference]: Finished difference. Result has 101 places, 83 transitions, 197 flow [2022-01-19 04:56:51,472 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=197, PETRI_PLACES=101, PETRI_TRANSITIONS=83} [2022-01-19 04:56:51,473 INFO L334 CegarLoopForPetriNet]: 101 programPoint places, 0 predicate places. [2022-01-19 04:56:51,473 INFO L470 AbstractCegarLoop]: Abstraction has has 101 places, 83 transitions, 197 flow [2022-01-19 04:56:51,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.28571428571429) internal successors, (555), 7 states have internal predecessors, (555), 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) [2022-01-19 04:56:51,474 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:56:51,474 INFO L254 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] [2022-01-19 04:56:51,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 04:56:51,474 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-01-19 04:56:51,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:56:51,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1234350663, now seen corresponding path program 3 times [2022-01-19 04:56:51,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:56:51,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514174823] [2022-01-19 04:56:51,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:56:51,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:56:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:56:51,533 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 04:56:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:56:51,597 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 04:56:51,598 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 04:56:51,598 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-01-19 04:56:51,600 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-01-19 04:56:51,600 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 5 remaining) [2022-01-19 04:56:51,600 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 5 remaining) [2022-01-19 04:56:51,600 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-01-19 04:56:51,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 04:56:51,603 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2022-01-19 04:56:51,607 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 04:56:51,607 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 04:56:51,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 04:56:51 BasicIcfg [2022-01-19 04:56:51,747 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 04:56:51,748 INFO L158 Benchmark]: Toolchain (without parser) took 4508.32ms. Allocated memory was 364.9MB in the beginning and 520.1MB in the end (delta: 155.2MB). Free memory was 309.8MB in the beginning and 484.6MB in the end (delta: -174.8MB). Peak memory consumption was 183.0MB. Max. memory is 16.0GB. [2022-01-19 04:56:51,748 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 364.9MB. Free memory is still 329.0MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 04:56:51,751 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.06ms. Allocated memory is still 364.9MB. Free memory was 309.6MB in the beginning and 326.5MB in the end (delta: -16.8MB). Peak memory consumption was 16.0MB. Max. memory is 16.0GB. [2022-01-19 04:56:51,752 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.58ms. Allocated memory is still 364.9MB. Free memory was 326.5MB in the beginning and 323.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 04:56:51,752 INFO L158 Benchmark]: Boogie Preprocessor took 38.92ms. Allocated memory is still 364.9MB. Free memory was 323.3MB in the beginning and 321.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 04:56:51,754 INFO L158 Benchmark]: RCFGBuilder took 904.55ms. Allocated memory is still 364.9MB. Free memory was 321.2MB in the beginning and 258.3MB in the end (delta: 62.9MB). Peak memory consumption was 62.9MB. Max. memory is 16.0GB. [2022-01-19 04:56:51,754 INFO L158 Benchmark]: TraceAbstraction took 2966.19ms. Allocated memory was 364.9MB in the beginning and 520.1MB in the end (delta: 155.2MB). Free memory was 258.3MB in the beginning and 484.6MB in the end (delta: -226.3MB). Peak memory consumption was 133.4MB. Max. memory is 16.0GB. [2022-01-19 04:56:51,755 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.11ms. Allocated memory is still 364.9MB. Free memory is still 329.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 518.06ms. Allocated memory is still 364.9MB. Free memory was 309.6MB in the beginning and 326.5MB in the end (delta: -16.8MB). Peak memory consumption was 16.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 74.58ms. Allocated memory is still 364.9MB. Free memory was 326.5MB in the beginning and 323.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 38.92ms. Allocated memory is still 364.9MB. Free memory was 323.3MB in the beginning and 321.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 904.55ms. Allocated memory is still 364.9MB. Free memory was 321.2MB in the beginning and 258.3MB in the end (delta: 62.9MB). Peak memory consumption was 62.9MB. Max. memory is 16.0GB. * TraceAbstraction took 2966.19ms. Allocated memory was 364.9MB in the beginning and 520.1MB in the end (delta: 155.2MB). Free memory was 258.3MB in the beginning and 484.6MB in the end (delta: -226.3MB). Peak memory consumption was 133.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L722] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L723] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L724] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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] [L725] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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] [L726] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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] [L727] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0] [L728] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0] [L729] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L730] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L731] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L732] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L733] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L734] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L735] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L737] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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, z=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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, z=0] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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, z=0] [L815] 0 pthread_t t1649; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1649={5: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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, z=0] [L816] FCALL, FORK 0 pthread_create(&t1649, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1649, ((void *)0), P0, ((void *)0))=-1, t1649={5: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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, z=0] [L817] 0 pthread_t t1650; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1649={5:0}, t1650={3: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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, z=0] [L818] FCALL, FORK 0 pthread_create(&t1650, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1650, ((void *)0), P1, ((void *)0))=0, t1649={5:0}, t1650={3: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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, z=0] [L773] 2 y$w_buff1 = y$w_buff0 [L774] 2 y$w_buff0 = 1 [L775] 2 y$w_buff1_used = y$w_buff0_used [L776] 2 y$w_buff0_used = (_Bool)1 [L777] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L777] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L778] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L779] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L780] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L781] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L749] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L750] 1 y$flush_delayed = weak$$choice2 [L751] 1 y$mem_tmp = y [L752] 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) [L752] 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) [L753] 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)) [L753] 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) [L753] 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)) [L753] 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)) [L754] 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)) [L754] 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) [L754] 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)) [L754] 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)) [L755] 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)) [L755] 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) [L755] 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)) [L755] 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)) [L756] 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)) [L756] 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) [L756] 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)) [L756] 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)) [L757] 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)) [L757] 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) [L757] 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)) [L757] 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)) [L758] 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)) [L758] 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) [L758] 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)) [L758] 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)) [L759] 1 __unbuffered_p0_EAX = y [L760] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L760] 1 y = y$flush_delayed ? y$mem_tmp : y [L761] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] 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) [L793] 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) [L794] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L794] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L795] 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 [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L797] 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 [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1649={5:0}, t1650={3:0}, weak$$choice0=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] 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) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] 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) [L824] 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) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 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 [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 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 [L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1649={5:0}, t1650={3:0}, weak$$choice0=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 117 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 157 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157 mSDsluCounter, 189 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 307 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 420 IncrementalHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 42 mSDtfsCounter, 420 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred in iteration=4, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 491 NumberOfCodeBlocks, 491 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 1179 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-19 04:56:51,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...