/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9e34d99ae2c6837f487980c721c4b6acf9d9b15c-9e34d99 [2021-07-09 16:51:59,877 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-09 16:51:59,880 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-09 16:51:59,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-09 16:51:59,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-09 16:51:59,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-09 16:51:59,924 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-09 16:51:59,929 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-09 16:51:59,931 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-09 16:51:59,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-09 16:51:59,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-09 16:51:59,937 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-09 16:51:59,938 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-09 16:51:59,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-09 16:51:59,941 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-09 16:51:59,942 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-09 16:51:59,945 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-09 16:51:59,945 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-09 16:51:59,947 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-09 16:51:59,952 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-09 16:51:59,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-09 16:51:59,954 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-09 16:51:59,955 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-09 16:51:59,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-09 16:51:59,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-09 16:51:59,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-09 16:51:59,964 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-09 16:51:59,965 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-09 16:51:59,965 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-09 16:51:59,966 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-09 16:51:59,966 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-09 16:51:59,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-09 16:51:59,970 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-09 16:51:59,970 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-09 16:51:59,971 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-09 16:51:59,972 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-09 16:51:59,972 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-09 16:51:59,972 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-09 16:51:59,972 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-09 16:51:59,973 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-09 16:51:59,974 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-09 16:51:59,978 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-FA-NoLbe.epf [2021-07-09 16:52:00,013 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-09 16:52:00,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-09 16:52:00,014 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-07-09 16:52:00,014 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-07-09 16:52:00,016 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-09 16:52:00,016 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-09 16:52:00,016 INFO L138 SettingsManager]: * Use SBE=true [2021-07-09 16:52:00,017 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-09 16:52:00,017 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-09 16:52:00,017 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-09 16:52:00,018 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-09 16:52:00,018 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-09 16:52:00,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-09 16:52:00,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-09 16:52:00,018 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-09 16:52:00,018 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-09 16:52:00,019 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-09 16:52:00,019 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-09 16:52:00,019 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-09 16:52:00,019 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-09 16:52:00,019 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-09 16:52:00,019 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-09 16:52:00,038 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-09 16:52:00,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-09 16:52:00,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-09 16:52:00,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-09 16:52:00,039 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-09 16:52:00,039 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-09 16:52:00,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-09 16:52:00,039 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-09 16:52:00,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-09 16:52:00,039 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-07-09 16:52:00,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-09 16:52:00,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-09 16:52:00,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-09 16:52:00,341 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-09 16:52:00,342 INFO L275 PluginConnector]: CDTParser initialized [2021-07-09 16:52:00,343 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_rmo.opt.i [2021-07-09 16:52:00,405 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff1ddabc1/d5f0cc8252d24d7193b16fbd2ac47661/FLAGc0a6c7292 [2021-07-09 16:52:00,979 INFO L306 CDTParser]: Found 1 translation units. [2021-07-09 16:52:00,979 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_rmo.opt.i [2021-07-09 16:52:00,997 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff1ddabc1/d5f0cc8252d24d7193b16fbd2ac47661/FLAGc0a6c7292 [2021-07-09 16:52:01,407 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff1ddabc1/d5f0cc8252d24d7193b16fbd2ac47661 [2021-07-09 16:52:01,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-09 16:52:01,411 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-09 16:52:01,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-09 16:52:01,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-09 16:52:01,421 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-09 16:52:01,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 04:52:01" (1/1) ... [2021-07-09 16:52:01,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6299c63d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:52:01, skipping insertion in model container [2021-07-09 16:52:01,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 04:52:01" (1/1) ... [2021-07-09 16:52:01,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-09 16:52:01,492 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-09 16:52:01,610 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_rmo.opt.i[992,1005] [2021-07-09 16:52:01,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 16:52:01,905 INFO L203 MainTranslator]: Completed pre-run [2021-07-09 16:52:01,915 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_rmo.opt.i[992,1005] [2021-07-09 16:52:01,950 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 16:52:01,980 INFO L208 MainTranslator]: Completed translation [2021-07-09 16:52:01,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:52:01 WrapperNode [2021-07-09 16:52:01,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-09 16:52:01,981 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-09 16:52:01,981 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-09 16:52:01,982 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-09 16:52:01,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:52:01" (1/1) ... [2021-07-09 16:52:02,003 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:52:01" (1/1) ... [2021-07-09 16:52:02,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-09 16:52:02,029 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-09 16:52:02,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-09 16:52:02,029 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-09 16:52:02,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:52:01" (1/1) ... [2021-07-09 16:52:02,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:52:01" (1/1) ... [2021-07-09 16:52:02,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:52:01" (1/1) ... [2021-07-09 16:52:02,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:52:01" (1/1) ... [2021-07-09 16:52:02,051 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:52:01" (1/1) ... [2021-07-09 16:52:02,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:52:01" (1/1) ... [2021-07-09 16:52:02,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:52:01" (1/1) ... [2021-07-09 16:52:02,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-09 16:52:02,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-09 16:52:02,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-09 16:52:02,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-09 16:52:02,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:52:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-09 16:52:02,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-09 16:52:02,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-07-09 16:52:02,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-09 16:52:02,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-09 16:52:02,166 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-07-09 16:52:02,168 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-07-09 16:52:02,168 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-07-09 16:52:02,168 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-07-09 16:52:02,168 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-07-09 16:52:02,168 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-07-09 16:52:02,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-09 16:52:02,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-07-09 16:52:02,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-09 16:52:02,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-09 16:52:02,171 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-09 16:52:05,277 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-09 16:52:05,277 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-07-09 16:52:05,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 04:52:05 BoogieIcfgContainer [2021-07-09 16:52:05,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-09 16:52:05,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-09 16:52:05,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-09 16:52:05,283 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-09 16:52:05,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.07 04:52:01" (1/3) ... [2021-07-09 16:52:05,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af8a8d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 04:52:05, skipping insertion in model container [2021-07-09 16:52:05,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:52:01" (2/3) ... [2021-07-09 16:52:05,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af8a8d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 04:52:05, skipping insertion in model container [2021-07-09 16:52:05,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 04:52:05" (3/3) ... [2021-07-09 16:52:05,286 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_rmo.opt.i [2021-07-09 16:52:05,295 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-09 16:52:05,295 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-09 16:52:05,295 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-07-09 16:52:05,296 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-09 16:52:05,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,343 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,343 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,343 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,343 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,347 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,348 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,349 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,351 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,352 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,352 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,352 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,352 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,352 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,352 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,353 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,354 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,357 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,357 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,357 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,358 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,358 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,358 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,359 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,360 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,361 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,363 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,364 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,371 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,372 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,374 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,374 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,374 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,374 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,374 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,374 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,374 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,374 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,376 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,377 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,378 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,379 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,380 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,381 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,382 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,382 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,382 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,382 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,382 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,383 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,383 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,383 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,384 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,384 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,384 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,384 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,385 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,390 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,391 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,394 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,396 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,399 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,399 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,400 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,403 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,403 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,411 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,411 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,411 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,411 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,413 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,415 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:52:05,417 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-07-09 16:52:05,440 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-09 16:52:05,468 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-09 16:52:05,468 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-09 16:52:05,468 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-09 16:52:05,468 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-09 16:52:05,469 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-09 16:52:05,469 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-09 16:52:05,469 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-09 16:52:05,469 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P2Thread1of1ForFork0======== [2021-07-09 16:52:05,483 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 106 transitions, 227 flow [2021-07-09 16:52:05,681 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5632 states, 5630 states have (on average 3.3650088809946714) internal successors, (18945), 5631 states have internal predecessors, (18945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:05,702 INFO L276 IsEmpty]: Start isEmpty. Operand has 5632 states, 5630 states have (on average 3.3650088809946714) internal successors, (18945), 5631 states have internal predecessors, (18945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:05,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-07-09 16:52:05,721 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:05,722 INFO L508 BasicCegarLoop]: 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] [2021-07-09 16:52:05,722 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:05,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:05,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1914108186, now seen corresponding path program 1 times [2021-07-09 16:52:05,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:05,734 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028252285] [2021-07-09 16:52:05,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:06,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:06,025 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:06,025 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028252285] [2021-07-09 16:52:06,025 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028252285] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:06,026 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:06,026 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-09 16:52:06,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326439585] [2021-07-09 16:52:06,029 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-09 16:52:06,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:06,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-09 16:52:06,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-09 16:52:06,077 INFO L87 Difference]: Start difference. First operand has 5632 states, 5630 states have (on average 3.3650088809946714) internal successors, (18945), 5631 states have internal predecessors, (18945), 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) Second operand has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:06,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:06,189 INFO L93 Difference]: Finished difference Result 3805 states and 11849 transitions. [2021-07-09 16:52:06,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-09 16:52:06,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 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) Word has length 55 [2021-07-09 16:52:06,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:06,195 INFO L225 Difference]: With dead ends: 3805 [2021-07-09 16:52:06,196 INFO L226 Difference]: Without dead ends: 0 [2021-07-09 16:52:06,197 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-09 16:52:06,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-09 16:52:06,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-09 16:52:06,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:06,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-09 16:52:06,217 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2021-07-09 16:52:06,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:06,217 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-09 16:52:06,217 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:06,218 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-09 16:52:06,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-09 16:52:06,218 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-09 16:52:06,219 INFO L301 ceAbstractionStarter]: Result for error location P2Thread1of1ForFork0 was SAFE (1/2) [2021-07-09 16:52:06,221 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-07-09 16:52:06,225 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-09 16:52:06,225 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-09 16:52:06,225 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-09 16:52:06,225 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-09 16:52:06,225 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-09 16:52:06,225 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-09 16:52:06,225 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-09 16:52:06,225 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-09 16:52:06,227 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 114 places, 106 transitions, 227 flow [2021-07-09 16:52:06,467 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 9601 states, 9599 states have (on average 3.5750599020731326) internal successors, (34317), 9600 states have internal predecessors, (34317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:06,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 9601 states, 9599 states have (on average 3.5750599020731326) internal successors, (34317), 9600 states have internal predecessors, (34317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:06,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-07-09 16:52:06,519 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:06,519 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:52:06,519 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:06,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:06,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1969788092, now seen corresponding path program 1 times [2021-07-09 16:52:06,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:06,520 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159138835] [2021-07-09 16:52:06,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:06,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:06,808 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:06,808 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159138835] [2021-07-09 16:52:06,809 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159138835] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:06,809 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:06,809 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:52:06,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387444078] [2021-07-09 16:52:06,810 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:52:06,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:06,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:52:06,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:52:06,837 INFO L87 Difference]: Start difference. First operand has 9601 states, 9599 states have (on average 3.5750599020731326) internal successors, (34317), 9600 states have internal predecessors, (34317), 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) Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:07,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:07,139 INFO L93 Difference]: Finished difference Result 10357 states and 36015 transitions. [2021-07-09 16:52:07,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:52:07,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 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) Word has length 67 [2021-07-09 16:52:07,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:07,229 INFO L225 Difference]: With dead ends: 10357 [2021-07-09 16:52:07,229 INFO L226 Difference]: Without dead ends: 7522 [2021-07-09 16:52:07,229 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 94.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:52:07,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7522 states. [2021-07-09 16:52:07,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7522 to 7522. [2021-07-09 16:52:07,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7522 states, 7520 states have (on average 3.460771276595745) internal successors, (26025), 7521 states have internal predecessors, (26025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:07,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7522 states to 7522 states and 26025 transitions. [2021-07-09 16:52:07,653 INFO L78 Accepts]: Start accepts. Automaton has 7522 states and 26025 transitions. Word has length 67 [2021-07-09 16:52:07,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:07,654 INFO L482 AbstractCegarLoop]: Abstraction has 7522 states and 26025 transitions. [2021-07-09 16:52:07,655 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:07,655 INFO L276 IsEmpty]: Start isEmpty. Operand 7522 states and 26025 transitions. [2021-07-09 16:52:07,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-07-09 16:52:07,674 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:07,674 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:52:07,674 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-09 16:52:07,674 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:07,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:07,675 INFO L82 PathProgramCache]: Analyzing trace with hash -175824292, now seen corresponding path program 1 times [2021-07-09 16:52:07,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:07,676 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015941850] [2021-07-09 16:52:07,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:07,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:07,940 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:07,940 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015941850] [2021-07-09 16:52:07,940 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015941850] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:07,940 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:07,940 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:52:07,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690850530] [2021-07-09 16:52:07,942 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:52:07,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:07,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:52:07,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:52:07,943 INFO L87 Difference]: Start difference. First operand 7522 states and 26025 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:08,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:08,222 INFO L93 Difference]: Finished difference Result 8542 states and 29306 transitions. [2021-07-09 16:52:08,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:52:08,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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) Word has length 71 [2021-07-09 16:52:08,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:08,273 INFO L225 Difference]: With dead ends: 8542 [2021-07-09 16:52:08,273 INFO L226 Difference]: Without dead ends: 7282 [2021-07-09 16:52:08,274 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 107.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:52:08,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7282 states. [2021-07-09 16:52:08,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7282 to 7282. [2021-07-09 16:52:08,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7282 states, 7280 states have (on average 3.449587912087912) internal successors, (25113), 7281 states have internal predecessors, (25113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:08,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7282 states to 7282 states and 25113 transitions. [2021-07-09 16:52:08,599 INFO L78 Accepts]: Start accepts. Automaton has 7282 states and 25113 transitions. Word has length 71 [2021-07-09 16:52:08,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:08,601 INFO L482 AbstractCegarLoop]: Abstraction has 7282 states and 25113 transitions. [2021-07-09 16:52:08,601 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:08,601 INFO L276 IsEmpty]: Start isEmpty. Operand 7282 states and 25113 transitions. [2021-07-09 16:52:08,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-07-09 16:52:08,632 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:08,632 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:52:08,632 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-09 16:52:08,633 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:08,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:08,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1596498909, now seen corresponding path program 1 times [2021-07-09 16:52:08,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:08,634 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094290] [2021-07-09 16:52:08,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:09,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:09,153 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:09,154 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094290] [2021-07-09 16:52:09,154 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094290] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:09,154 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:09,154 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-07-09 16:52:09,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901648199] [2021-07-09 16:52:09,155 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-07-09 16:52:09,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:09,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-07-09 16:52:09,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2021-07-09 16:52:09,156 INFO L87 Difference]: Start difference. First operand 7282 states and 25113 transitions. Second operand has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:09,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:09,876 INFO L93 Difference]: Finished difference Result 10133 states and 34449 transitions. [2021-07-09 16:52:09,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-07-09 16:52:09,876 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 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) Word has length 73 [2021-07-09 16:52:09,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:09,908 INFO L225 Difference]: With dead ends: 10133 [2021-07-09 16:52:09,908 INFO L226 Difference]: Without dead ends: 7117 [2021-07-09 16:52:09,909 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 473.3ms TimeCoverageRelationStatistics Valid=198, Invalid=402, Unknown=0, NotChecked=0, Total=600 [2021-07-09 16:52:09,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7117 states. [2021-07-09 16:52:10,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7117 to 7117. [2021-07-09 16:52:10,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7117 states, 7116 states have (on average 3.4093591905564926) internal successors, (24261), 7116 states have internal predecessors, (24261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:10,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7117 states to 7117 states and 24261 transitions. [2021-07-09 16:52:10,133 INFO L78 Accepts]: Start accepts. Automaton has 7117 states and 24261 transitions. Word has length 73 [2021-07-09 16:52:10,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:10,134 INFO L482 AbstractCegarLoop]: Abstraction has 7117 states and 24261 transitions. [2021-07-09 16:52:10,134 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:10,134 INFO L276 IsEmpty]: Start isEmpty. Operand 7117 states and 24261 transitions. [2021-07-09 16:52:10,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-07-09 16:52:10,152 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:10,152 INFO L508 BasicCegarLoop]: 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] [2021-07-09 16:52:10,152 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-09 16:52:10,152 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:10,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:10,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2005955707, now seen corresponding path program 1 times [2021-07-09 16:52:10,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:10,153 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727118112] [2021-07-09 16:52:10,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:10,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:10,334 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:10,335 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727118112] [2021-07-09 16:52:10,335 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727118112] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:10,335 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:10,335 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:52:10,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860565139] [2021-07-09 16:52:10,336 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:52:10,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:10,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:52:10,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:52:10,336 INFO L87 Difference]: Start difference. First operand 7117 states and 24261 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:10,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:10,492 INFO L93 Difference]: Finished difference Result 10758 states and 36233 transitions. [2021-07-09 16:52:10,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:52:10,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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) Word has length 75 [2021-07-09 16:52:10,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:10,519 INFO L225 Difference]: With dead ends: 10758 [2021-07-09 16:52:10,519 INFO L226 Difference]: Without dead ends: 6225 [2021-07-09 16:52:10,519 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 84.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:52:10,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6225 states. [2021-07-09 16:52:10,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6225 to 5625. [2021-07-09 16:52:10,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5625 states, 5624 states have (on average 3.3220128022759603) internal successors, (18683), 5624 states have internal predecessors, (18683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:10,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5625 states to 5625 states and 18683 transitions. [2021-07-09 16:52:10,696 INFO L78 Accepts]: Start accepts. Automaton has 5625 states and 18683 transitions. Word has length 75 [2021-07-09 16:52:10,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:10,696 INFO L482 AbstractCegarLoop]: Abstraction has 5625 states and 18683 transitions. [2021-07-09 16:52:10,696 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:10,697 INFO L276 IsEmpty]: Start isEmpty. Operand 5625 states and 18683 transitions. [2021-07-09 16:52:10,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-09 16:52:10,712 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:10,712 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:52:10,713 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-09 16:52:10,713 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:10,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:10,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1708555019, now seen corresponding path program 1 times [2021-07-09 16:52:10,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:10,714 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136816620] [2021-07-09 16:52:10,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:11,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:11,022 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:11,022 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136816620] [2021-07-09 16:52:11,022 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136816620] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:11,023 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:11,023 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-09 16:52:11,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255784410] [2021-07-09 16:52:11,024 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-09 16:52:11,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:11,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-09 16:52:11,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-07-09 16:52:11,025 INFO L87 Difference]: Start difference. First operand 5625 states and 18683 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:11,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:11,416 INFO L93 Difference]: Finished difference Result 8457 states and 27845 transitions. [2021-07-09 16:52:11,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-09 16:52:11,417 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 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) Word has length 76 [2021-07-09 16:52:11,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:11,439 INFO L225 Difference]: With dead ends: 8457 [2021-07-09 16:52:11,440 INFO L226 Difference]: Without dead ends: 6013 [2021-07-09 16:52:11,440 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 182.3ms TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2021-07-09 16:52:11,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6013 states. [2021-07-09 16:52:11,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6013 to 5991. [2021-07-09 16:52:11,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5991 states, 5990 states have (on average 3.3173622704507513) internal successors, (19871), 5990 states have internal predecessors, (19871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:11,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5991 states to 5991 states and 19871 transitions. [2021-07-09 16:52:11,622 INFO L78 Accepts]: Start accepts. Automaton has 5991 states and 19871 transitions. Word has length 76 [2021-07-09 16:52:11,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:11,622 INFO L482 AbstractCegarLoop]: Abstraction has 5991 states and 19871 transitions. [2021-07-09 16:52:11,623 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:11,623 INFO L276 IsEmpty]: Start isEmpty. Operand 5991 states and 19871 transitions. [2021-07-09 16:52:11,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-09 16:52:11,636 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:11,637 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:52:11,637 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-09 16:52:11,637 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:11,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:11,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1122461241, now seen corresponding path program 2 times [2021-07-09 16:52:11,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:11,638 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825820800] [2021-07-09 16:52:11,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:12,007 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:12,007 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825820800] [2021-07-09 16:52:12,007 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825820800] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:12,007 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:12,007 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-07-09 16:52:12,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770635608] [2021-07-09 16:52:12,008 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-07-09 16:52:12,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:12,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-07-09 16:52:12,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-07-09 16:52:12,009 INFO L87 Difference]: Start difference. First operand 5991 states and 19871 transitions. Second operand has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:12,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:12,488 INFO L93 Difference]: Finished difference Result 6911 states and 22719 transitions. [2021-07-09 16:52:12,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-07-09 16:52:12,488 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 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) Word has length 76 [2021-07-09 16:52:12,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:12,512 INFO L225 Difference]: With dead ends: 6911 [2021-07-09 16:52:12,513 INFO L226 Difference]: Without dead ends: 5927 [2021-07-09 16:52:12,515 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 297.3ms TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2021-07-09 16:52:12,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5927 states. [2021-07-09 16:52:12,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5927 to 5867. [2021-07-09 16:52:12,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5867 states, 5866 states have (on average 3.315888169110126) internal successors, (19451), 5866 states have internal predecessors, (19451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:12,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5867 states to 5867 states and 19451 transitions. [2021-07-09 16:52:12,664 INFO L78 Accepts]: Start accepts. Automaton has 5867 states and 19451 transitions. Word has length 76 [2021-07-09 16:52:12,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:12,664 INFO L482 AbstractCegarLoop]: Abstraction has 5867 states and 19451 transitions. [2021-07-09 16:52:12,665 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:12,665 INFO L276 IsEmpty]: Start isEmpty. Operand 5867 states and 19451 transitions. [2021-07-09 16:52:12,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-09 16:52:12,678 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:12,678 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:52:12,679 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-09 16:52:12,679 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:12,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:12,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1263137743, now seen corresponding path program 3 times [2021-07-09 16:52:12,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:12,679 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143806582] [2021-07-09 16:52:12,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:13,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:13,062 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:13,062 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143806582] [2021-07-09 16:52:13,063 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143806582] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:13,063 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:13,063 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-07-09 16:52:13,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729052879] [2021-07-09 16:52:13,063 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-07-09 16:52:13,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:13,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-07-09 16:52:13,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-07-09 16:52:13,064 INFO L87 Difference]: Start difference. First operand 5867 states and 19451 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:13,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:13,616 INFO L93 Difference]: Finished difference Result 8075 states and 26588 transitions. [2021-07-09 16:52:13,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-09 16:52:13,617 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 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) Word has length 76 [2021-07-09 16:52:13,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:13,639 INFO L225 Difference]: With dead ends: 8075 [2021-07-09 16:52:13,639 INFO L226 Difference]: Without dead ends: 6236 [2021-07-09 16:52:13,640 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 344.9ms TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2021-07-09 16:52:13,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6236 states. [2021-07-09 16:52:13,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6236 to 6164. [2021-07-09 16:52:13,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6164 states, 6163 states have (on average 3.3142949862080155) internal successors, (20426), 6163 states have internal predecessors, (20426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:13,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6164 states to 6164 states and 20426 transitions. [2021-07-09 16:52:13,810 INFO L78 Accepts]: Start accepts. Automaton has 6164 states and 20426 transitions. Word has length 76 [2021-07-09 16:52:13,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:13,810 INFO L482 AbstractCegarLoop]: Abstraction has 6164 states and 20426 transitions. [2021-07-09 16:52:13,811 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:13,811 INFO L276 IsEmpty]: Start isEmpty. Operand 6164 states and 20426 transitions. [2021-07-09 16:52:13,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-09 16:52:13,826 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:13,826 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:52:13,826 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-09 16:52:13,826 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:13,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:13,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1567878517, now seen corresponding path program 4 times [2021-07-09 16:52:13,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:13,827 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270645011] [2021-07-09 16:52:13,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:14,096 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:14,096 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270645011] [2021-07-09 16:52:14,096 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270645011] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:14,096 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:14,096 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-07-09 16:52:14,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609948310] [2021-07-09 16:52:14,096 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-07-09 16:52:14,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:14,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-07-09 16:52:14,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2021-07-09 16:52:14,097 INFO L87 Difference]: Start difference. First operand 6164 states and 20426 transitions. Second operand has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:14,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:14,761 INFO L93 Difference]: Finished difference Result 6908 states and 22727 transitions. [2021-07-09 16:52:14,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-07-09 16:52:14,762 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 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) Word has length 76 [2021-07-09 16:52:14,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:14,784 INFO L225 Difference]: With dead ends: 6908 [2021-07-09 16:52:14,784 INFO L226 Difference]: Without dead ends: 6308 [2021-07-09 16:52:14,784 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 397.8ms TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2021-07-09 16:52:14,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6308 states. [2021-07-09 16:52:14,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6308 to 6164. [2021-07-09 16:52:14,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6164 states, 6163 states have (on average 3.3142949862080155) internal successors, (20426), 6163 states have internal predecessors, (20426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:14,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6164 states to 6164 states and 20426 transitions. [2021-07-09 16:52:14,953 INFO L78 Accepts]: Start accepts. Automaton has 6164 states and 20426 transitions. Word has length 76 [2021-07-09 16:52:14,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:14,954 INFO L482 AbstractCegarLoop]: Abstraction has 6164 states and 20426 transitions. [2021-07-09 16:52:14,954 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:14,954 INFO L276 IsEmpty]: Start isEmpty. Operand 6164 states and 20426 transitions. [2021-07-09 16:52:14,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-09 16:52:14,968 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:14,968 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:52:14,968 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-07-09 16:52:14,968 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:14,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:14,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1953502855, now seen corresponding path program 5 times [2021-07-09 16:52:14,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:14,969 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327517646] [2021-07-09 16:52:14,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:15,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:15,268 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:15,268 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327517646] [2021-07-09 16:52:15,268 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327517646] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:15,268 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:15,268 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-07-09 16:52:15,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541036440] [2021-07-09 16:52:15,269 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-07-09 16:52:15,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:15,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-07-09 16:52:15,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2021-07-09 16:52:15,269 INFO L87 Difference]: Start difference. First operand 6164 states and 20426 transitions. Second operand has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:15,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:15,816 INFO L93 Difference]: Finished difference Result 7055 states and 23190 transitions. [2021-07-09 16:52:15,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-07-09 16:52:15,817 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 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) Word has length 76 [2021-07-09 16:52:15,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:15,838 INFO L225 Difference]: With dead ends: 7055 [2021-07-09 16:52:15,838 INFO L226 Difference]: Without dead ends: 6368 [2021-07-09 16:52:15,839 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 329.3ms TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2021-07-09 16:52:15,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6368 states. [2021-07-09 16:52:15,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6368 to 6134. [2021-07-09 16:52:15,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6134 states, 6133 states have (on average 3.3150171204956793) internal successors, (20331), 6133 states have internal predecessors, (20331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:15,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6134 states to 6134 states and 20331 transitions. [2021-07-09 16:52:15,991 INFO L78 Accepts]: Start accepts. Automaton has 6134 states and 20331 transitions. Word has length 76 [2021-07-09 16:52:15,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:15,991 INFO L482 AbstractCegarLoop]: Abstraction has 6134 states and 20331 transitions. [2021-07-09 16:52:15,992 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:15,992 INFO L276 IsEmpty]: Start isEmpty. Operand 6134 states and 20331 transitions. [2021-07-09 16:52:16,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-09 16:52:16,005 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:16,006 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:52:16,006 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-07-09 16:52:16,006 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:16,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:16,006 INFO L82 PathProgramCache]: Analyzing trace with hash 955902061, now seen corresponding path program 6 times [2021-07-09 16:52:16,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:16,007 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355891724] [2021-07-09 16:52:16,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:16,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:16,189 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:16,189 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355891724] [2021-07-09 16:52:16,189 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355891724] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:16,189 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:16,189 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-09 16:52:16,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483286979] [2021-07-09 16:52:16,190 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-09 16:52:16,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:16,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-09 16:52:16,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-07-09 16:52:16,191 INFO L87 Difference]: Start difference. First operand 6134 states and 20331 transitions. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:16,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:16,822 INFO L93 Difference]: Finished difference Result 10192 states and 33448 transitions. [2021-07-09 16:52:16,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-07-09 16:52:16,823 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 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) Word has length 76 [2021-07-09 16:52:16,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:16,847 INFO L225 Difference]: With dead ends: 10192 [2021-07-09 16:52:16,848 INFO L226 Difference]: Without dead ends: 7872 [2021-07-09 16:52:16,848 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 370.5ms TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2021-07-09 16:52:16,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7872 states. [2021-07-09 16:52:17,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7872 to 6182. [2021-07-09 16:52:17,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6182 states, 6181 states have (on average 3.30237825594564) internal successors, (20412), 6181 states have internal predecessors, (20412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:17,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6182 states to 6182 states and 20412 transitions. [2021-07-09 16:52:17,100 INFO L78 Accepts]: Start accepts. Automaton has 6182 states and 20412 transitions. Word has length 76 [2021-07-09 16:52:17,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:17,101 INFO L482 AbstractCegarLoop]: Abstraction has 6182 states and 20412 transitions. [2021-07-09 16:52:17,101 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:17,101 INFO L276 IsEmpty]: Start isEmpty. Operand 6182 states and 20412 transitions. [2021-07-09 16:52:17,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-09 16:52:17,116 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:17,116 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:52:17,116 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-07-09 16:52:17,117 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:17,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:17,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1875114199, now seen corresponding path program 7 times [2021-07-09 16:52:17,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:17,118 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613212252] [2021-07-09 16:52:17,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:17,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:17,374 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:17,375 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613212252] [2021-07-09 16:52:17,375 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613212252] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:17,375 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:17,375 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-09 16:52:17,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429489902] [2021-07-09 16:52:17,375 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-09 16:52:17,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:17,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-09 16:52:17,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-07-09 16:52:17,377 INFO L87 Difference]: Start difference. First operand 6182 states and 20412 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:18,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:18,039 INFO L93 Difference]: Finished difference Result 11169 states and 36472 transitions. [2021-07-09 16:52:18,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-07-09 16:52:18,040 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 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) Word has length 76 [2021-07-09 16:52:18,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:18,051 INFO L225 Difference]: With dead ends: 11169 [2021-07-09 16:52:18,051 INFO L226 Difference]: Without dead ends: 4720 [2021-07-09 16:52:18,052 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 464.6ms TimeCoverageRelationStatistics Valid=247, Invalid=509, Unknown=0, NotChecked=0, Total=756 [2021-07-09 16:52:18,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4720 states. [2021-07-09 16:52:18,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4720 to 3798. [2021-07-09 16:52:18,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3798 states, 3797 states have (on average 3.1919936792204373) internal successors, (12120), 3797 states have internal predecessors, (12120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:18,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3798 states to 3798 states and 12120 transitions. [2021-07-09 16:52:18,163 INFO L78 Accepts]: Start accepts. Automaton has 3798 states and 12120 transitions. Word has length 76 [2021-07-09 16:52:18,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:18,163 INFO L482 AbstractCegarLoop]: Abstraction has 3798 states and 12120 transitions. [2021-07-09 16:52:18,163 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:18,163 INFO L276 IsEmpty]: Start isEmpty. Operand 3798 states and 12120 transitions. [2021-07-09 16:52:18,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-07-09 16:52:18,171 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:18,171 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:52:18,171 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-07-09 16:52:18,171 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:18,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:18,172 INFO L82 PathProgramCache]: Analyzing trace with hash 994563779, now seen corresponding path program 1 times [2021-07-09 16:52:18,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:18,172 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706588568] [2021-07-09 16:52:18,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:18,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:18,650 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:18,650 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706588568] [2021-07-09 16:52:18,650 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706588568] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:18,650 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:18,650 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-07-09 16:52:18,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883442338] [2021-07-09 16:52:18,651 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-07-09 16:52:18,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:18,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-07-09 16:52:18,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2021-07-09 16:52:18,652 INFO L87 Difference]: Start difference. First operand 3798 states and 12120 transitions. Second operand has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:19,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:19,326 INFO L93 Difference]: Finished difference Result 4239 states and 13468 transitions. [2021-07-09 16:52:19,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-07-09 16:52:19,327 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 states have internal predecessors, (77), 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) Word has length 77 [2021-07-09 16:52:19,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:19,337 INFO L225 Difference]: With dead ends: 4239 [2021-07-09 16:52:19,337 INFO L226 Difference]: Without dead ends: 3592 [2021-07-09 16:52:19,338 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 702.9ms TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2021-07-09 16:52:19,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3592 states. [2021-07-09 16:52:19,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3592 to 3182. [2021-07-09 16:52:19,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3182 states, 3181 states have (on average 3.1879911977365607) internal successors, (10141), 3181 states have internal predecessors, (10141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:19,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 10141 transitions. [2021-07-09 16:52:19,420 INFO L78 Accepts]: Start accepts. Automaton has 3182 states and 10141 transitions. Word has length 77 [2021-07-09 16:52:19,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:19,420 INFO L482 AbstractCegarLoop]: Abstraction has 3182 states and 10141 transitions. [2021-07-09 16:52:19,420 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 4.529411764705882) internal successors, (77), 17 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:19,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 10141 transitions. [2021-07-09 16:52:19,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-07-09 16:52:19,426 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:19,426 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:52:19,426 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-07-09 16:52:19,426 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:19,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:19,427 INFO L82 PathProgramCache]: Analyzing trace with hash 587070336, now seen corresponding path program 1 times [2021-07-09 16:52:19,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:19,427 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731599169] [2021-07-09 16:52:19,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:19,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:19,535 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:19,536 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731599169] [2021-07-09 16:52:19,536 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731599169] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:19,536 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:19,536 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:52:19,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144508661] [2021-07-09 16:52:19,536 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:52:19,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:19,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:52:19,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:52:19,538 INFO L87 Difference]: Start difference. First operand 3182 states and 10141 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:19,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:19,658 INFO L93 Difference]: Finished difference Result 3758 states and 11832 transitions. [2021-07-09 16:52:19,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:52:19,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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) Word has length 77 [2021-07-09 16:52:19,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:19,666 INFO L225 Difference]: With dead ends: 3758 [2021-07-09 16:52:19,666 INFO L226 Difference]: Without dead ends: 2690 [2021-07-09 16:52:19,666 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 90.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:52:19,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2021-07-09 16:52:19,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2690. [2021-07-09 16:52:19,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2690 states, 2689 states have (on average 3.1420602454444033) internal successors, (8449), 2689 states have internal predecessors, (8449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:19,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2690 states and 8449 transitions. [2021-07-09 16:52:19,741 INFO L78 Accepts]: Start accepts. Automaton has 2690 states and 8449 transitions. Word has length 77 [2021-07-09 16:52:19,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:19,741 INFO L482 AbstractCegarLoop]: Abstraction has 2690 states and 8449 transitions. [2021-07-09 16:52:19,741 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:19,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2690 states and 8449 transitions. [2021-07-09 16:52:19,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-07-09 16:52:19,749 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:19,749 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:52:19,749 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-07-09 16:52:19,749 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:19,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:19,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1281429161, now seen corresponding path program 1 times [2021-07-09 16:52:19,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:19,750 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324262780] [2021-07-09 16:52:19,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:19,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:19,858 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:19,858 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324262780] [2021-07-09 16:52:19,859 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324262780] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:19,859 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:19,859 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 16:52:19,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902977921] [2021-07-09 16:52:19,859 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 16:52:19,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:19,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 16:52:19,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-09 16:52:19,860 INFO L87 Difference]: Start difference. First operand 2690 states and 8449 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:19,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:19,995 INFO L93 Difference]: Finished difference Result 2762 states and 8494 transitions. [2021-07-09 16:52:19,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-09 16:52:19,996 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 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) Word has length 78 [2021-07-09 16:52:19,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:20,001 INFO L225 Difference]: With dead ends: 2762 [2021-07-09 16:52:20,002 INFO L226 Difference]: Without dead ends: 2006 [2021-07-09 16:52:20,003 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 102.9ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-07-09 16:52:20,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states. [2021-07-09 16:52:20,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 2006. [2021-07-09 16:52:20,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2006 states, 2005 states have (on average 3.0349127182044886) internal successors, (6085), 2005 states have internal predecessors, (6085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:20,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 6085 transitions. [2021-07-09 16:52:20,053 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 6085 transitions. Word has length 78 [2021-07-09 16:52:20,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:20,053 INFO L482 AbstractCegarLoop]: Abstraction has 2006 states and 6085 transitions. [2021-07-09 16:52:20,053 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:20,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 6085 transitions. [2021-07-09 16:52:20,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-07-09 16:52:20,057 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:20,057 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:52:20,058 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-07-09 16:52:20,058 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:20,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:20,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1288565066, now seen corresponding path program 1 times [2021-07-09 16:52:20,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:20,058 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790969030] [2021-07-09 16:52:20,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:20,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:20,180 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:20,180 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790969030] [2021-07-09 16:52:20,182 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790969030] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:20,182 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:20,182 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-09 16:52:20,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418342046] [2021-07-09 16:52:20,182 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-09 16:52:20,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:20,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-09 16:52:20,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-07-09 16:52:20,183 INFO L87 Difference]: Start difference. First operand 2006 states and 6085 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:20,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:20,329 INFO L93 Difference]: Finished difference Result 1700 states and 5002 transitions. [2021-07-09 16:52:20,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-09 16:52:20,330 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 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) Word has length 80 [2021-07-09 16:52:20,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:20,333 INFO L225 Difference]: With dead ends: 1700 [2021-07-09 16:52:20,333 INFO L226 Difference]: Without dead ends: 1304 [2021-07-09 16:52:20,333 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 120.1ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-07-09 16:52:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2021-07-09 16:52:20,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1304. [2021-07-09 16:52:20,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 1303 states have (on average 2.874136607828089) internal successors, (3745), 1303 states have internal predecessors, (3745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:20,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 3745 transitions. [2021-07-09 16:52:20,361 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 3745 transitions. Word has length 80 [2021-07-09 16:52:20,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:20,362 INFO L482 AbstractCegarLoop]: Abstraction has 1304 states and 3745 transitions. [2021-07-09 16:52:20,362 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:20,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 3745 transitions. [2021-07-09 16:52:20,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-07-09 16:52:20,365 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:20,365 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:52:20,365 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-07-09 16:52:20,365 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:20,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:20,366 INFO L82 PathProgramCache]: Analyzing trace with hash -380848171, now seen corresponding path program 1 times [2021-07-09 16:52:20,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:20,366 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775355976] [2021-07-09 16:52:20,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:20,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:20,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:20,892 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:20,893 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775355976] [2021-07-09 16:52:20,893 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775355976] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:20,893 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:20,893 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-07-09 16:52:20,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061499346] [2021-07-09 16:52:20,893 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-07-09 16:52:20,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:20,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-07-09 16:52:20,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2021-07-09 16:52:20,894 INFO L87 Difference]: Start difference. First operand 1304 states and 3745 transitions. Second operand has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 19 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:21,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:21,221 INFO L93 Difference]: Finished difference Result 2411 states and 7108 transitions. [2021-07-09 16:52:21,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-07-09 16:52:21,221 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 19 states have internal predecessors, (82), 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) Word has length 82 [2021-07-09 16:52:21,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:21,223 INFO L225 Difference]: With dead ends: 2411 [2021-07-09 16:52:21,223 INFO L226 Difference]: Without dead ends: 1266 [2021-07-09 16:52:21,224 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 450.4ms TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2021-07-09 16:52:21,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2021-07-09 16:52:21,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1251. [2021-07-09 16:52:21,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 1250 states have (on average 2.8904) internal successors, (3613), 1250 states have internal predecessors, (3613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 3613 transitions. [2021-07-09 16:52:21,243 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 3613 transitions. Word has length 82 [2021-07-09 16:52:21,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:21,244 INFO L482 AbstractCegarLoop]: Abstraction has 1251 states and 3613 transitions. [2021-07-09 16:52:21,244 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 4.315789473684211) internal successors, (82), 19 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:21,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 3613 transitions. [2021-07-09 16:52:21,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-07-09 16:52:21,246 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:21,246 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:52:21,246 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-07-09 16:52:21,247 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:21,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:21,247 INFO L82 PathProgramCache]: Analyzing trace with hash -2015125931, now seen corresponding path program 2 times [2021-07-09 16:52:21,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:21,247 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682885223] [2021-07-09 16:52:21,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:21,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:21,489 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:21,489 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682885223] [2021-07-09 16:52:21,489 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682885223] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:21,489 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:21,489 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-09 16:52:21,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610755032] [2021-07-09 16:52:21,490 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-09 16:52:21,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:21,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-09 16:52:21,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-07-09 16:52:21,490 INFO L87 Difference]: Start difference. First operand 1251 states and 3613 transitions. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:21,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:21,954 INFO L93 Difference]: Finished difference Result 1776 states and 5175 transitions. [2021-07-09 16:52:21,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-09 16:52:21,954 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 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) Word has length 82 [2021-07-09 16:52:21,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:21,956 INFO L225 Difference]: With dead ends: 1776 [2021-07-09 16:52:21,956 INFO L226 Difference]: Without dead ends: 837 [2021-07-09 16:52:21,956 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 369.9ms TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2021-07-09 16:52:21,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2021-07-09 16:52:21,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2021-07-09 16:52:21,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 2.787081339712919) internal successors, (2330), 836 states have internal predecessors, (2330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:21,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 2330 transitions. [2021-07-09 16:52:21,969 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 2330 transitions. Word has length 82 [2021-07-09 16:52:21,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:21,969 INFO L482 AbstractCegarLoop]: Abstraction has 837 states and 2330 transitions. [2021-07-09 16:52:21,969 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:21,969 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 2330 transitions. [2021-07-09 16:52:21,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-07-09 16:52:21,970 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:21,970 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:52:21,971 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-07-09 16:52:21,971 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:21,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:21,971 INFO L82 PathProgramCache]: Analyzing trace with hash 897147383, now seen corresponding path program 3 times [2021-07-09 16:52:21,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:21,971 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183684887] [2021-07-09 16:52:21,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:52:22,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:52:22,200 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:52:22,200 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183684887] [2021-07-09 16:52:22,201 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183684887] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:52:22,201 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:52:22,201 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-09 16:52:22,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230294996] [2021-07-09 16:52:22,201 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-09 16:52:22,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:52:22,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-09 16:52:22,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:52:22,202 INFO L87 Difference]: Start difference. First operand 837 states and 2330 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:22,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:52:22,403 INFO L93 Difference]: Finished difference Result 1431 states and 4103 transitions. [2021-07-09 16:52:22,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-09 16:52:22,404 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 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) Word has length 82 [2021-07-09 16:52:22,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:52:22,406 INFO L225 Difference]: With dead ends: 1431 [2021-07-09 16:52:22,406 INFO L226 Difference]: Without dead ends: 807 [2021-07-09 16:52:22,406 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 156.0ms TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2021-07-09 16:52:22,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2021-07-09 16:52:22,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 807. [2021-07-09 16:52:22,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 806 states have (on average 2.7841191066997517) internal successors, (2244), 806 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:22,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 2244 transitions. [2021-07-09 16:52:22,418 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 2244 transitions. Word has length 82 [2021-07-09 16:52:22,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:52:22,418 INFO L482 AbstractCegarLoop]: Abstraction has 807 states and 2244 transitions. [2021-07-09 16:52:22,418 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:52:22,419 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 2244 transitions. [2021-07-09 16:52:22,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-07-09 16:52:22,420 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:52:22,420 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:52:22,420 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-07-09 16:52:22,420 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:52:22,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:52:22,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1752140297, now seen corresponding path program 4 times [2021-07-09 16:52:22,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:52:22,421 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467390665] [2021-07-09 16:52:22,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:52:22,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-09 16:52:22,481 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-09 16:52:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-09 16:52:22,549 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-09 16:52:22,605 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-09 16:52:22,605 INFO L609 BasicCegarLoop]: Counterexample might be feasible [2021-07-09 16:52:22,606 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-07-09 16:52:22,606 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2021-07-09 16:52:22,608 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-09 16:52:22,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.07 04:52:22 BasicIcfg [2021-07-09 16:52:22,770 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-09 16:52:22,771 INFO L168 Benchmark]: Toolchain (without parser) took 21359.63 ms. Allocated memory was 204.5 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 167.0 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 420.1 MB. Max. memory is 8.0 GB. [2021-07-09 16:52:22,771 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 204.5 MB. Free memory was 185.7 MB in the beginning and 185.5 MB in the end (delta: 106.2 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-07-09 16:52:22,771 INFO L168 Benchmark]: CACSL2BoogieTranslator took 563.75 ms. Allocated memory is still 204.5 MB. Free memory was 166.8 MB in the beginning and 172.4 MB in the end (delta: -5.6 MB). Peak memory consumption was 13.7 MB. Max. memory is 8.0 GB. [2021-07-09 16:52:22,771 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.20 ms. Allocated memory is still 204.5 MB. Free memory was 172.4 MB in the beginning and 169.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-07-09 16:52:22,771 INFO L168 Benchmark]: Boogie Preprocessor took 35.03 ms. Allocated memory is still 204.5 MB. Free memory was 169.4 MB in the beginning and 166.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-07-09 16:52:22,771 INFO L168 Benchmark]: RCFGBuilder took 3214.56 ms. Allocated memory was 204.5 MB in the beginning and 264.2 MB in the end (delta: 59.8 MB). Free memory was 166.3 MB in the beginning and 234.2 MB in the end (delta: -67.9 MB). Peak memory consumption was 145.2 MB. Max. memory is 8.0 GB. [2021-07-09 16:52:22,771 INFO L168 Benchmark]: TraceAbstraction took 17489.62 ms. Allocated memory was 264.2 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 233.7 MB in the beginning and 1.6 GB in the end (delta: -1.3 GB). Peak memory consumption was 426.3 MB. Max. memory is 8.0 GB. [2021-07-09 16:52:22,772 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.15 ms. Allocated memory is still 204.5 MB. Free memory was 185.7 MB in the beginning and 185.5 MB in the end (delta: 106.2 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 563.75 ms. Allocated memory is still 204.5 MB. Free memory was 166.8 MB in the beginning and 172.4 MB in the end (delta: -5.6 MB). Peak memory consumption was 13.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 47.20 ms. Allocated memory is still 204.5 MB. Free memory was 172.4 MB in the beginning and 169.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 35.03 ms. Allocated memory is still 204.5 MB. Free memory was 169.4 MB in the beginning and 166.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 3214.56 ms. Allocated memory was 204.5 MB in the beginning and 264.2 MB in the end (delta: 59.8 MB). Free memory was 166.3 MB in the beginning and 234.2 MB in the end (delta: -67.9 MB). Peak memory consumption was 145.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 17489.62 ms. Allocated memory was 264.2 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 233.7 MB in the beginning and 1.6 GB in the end (delta: -1.3 GB). Peak memory consumption was 426.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L720] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L721] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L722] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L723] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L724] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L725] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L726] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L727] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L728] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L729] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L730] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L731] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L732] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L733] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L734] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L736] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L738] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L849] 0 pthread_t t2552; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L850] FCALL, FORK 0 pthread_create(&t2552, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2553; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L852] FCALL, FORK 0 pthread_create(&t2553, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2554; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L854] FCALL, FORK 0 pthread_create(&t2554, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 3 !(!expression) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L872] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L875] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L877] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P2Thread1of1ForFork0 with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 752.5ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 39.8ms, AutomataDifference: 166.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 212.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 87 SDtfs, 33 SDslu, 26 SDs, 0 SdLazy, 6 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5632occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 8.1ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 13.3ms SsaConstructionTime, 80.0ms SatisfiabilityAnalysisTime, 125.4ms InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 110 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16381.6ms, OverallIterations: 19, TraceHistogramMax: 1, EmptinessCheckTime: 249.8ms, AutomataDifference: 7888.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 242.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2554 SDtfs, 5069 SDslu, 13026 SDs, 0 SdLazy, 2479 SolverSat, 667 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2861.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 348 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 310 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1139 ImplicationChecksByTransitivity, 5140.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=9601occurred in iteration=0, InterpolantAutomatonStates: 254, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2610.6ms AutomataMinimizationTime, 18 MinimizatonAttempts, 4169 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 83.6ms SsaConstructionTime, 1144.9ms SatisfiabilityAnalysisTime, 3804.6ms InterpolantComputationTime, 1458 NumberOfCodeBlocks, 1458 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1358 ConstructedInterpolants, 0 QuantifiedInterpolants, 9802 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...