/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/rfi003_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9bbddad6b14272d9691b7fb6f1c011d15ab18596-9bbddad [2021-06-12 17:12:16,262 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-12 17:12:16,264 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-12 17:12:16,294 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-12 17:12:16,294 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-12 17:12:16,297 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-12 17:12:16,299 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-12 17:12:16,303 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-12 17:12:16,304 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-12 17:12:16,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-12 17:12:16,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-12 17:12:16,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-12 17:12:16,309 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-12 17:12:16,310 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-12 17:12:16,311 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-12 17:12:16,312 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-12 17:12:16,314 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-12 17:12:16,315 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-12 17:12:16,317 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-12 17:12:16,337 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-12 17:12:16,338 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-12 17:12:16,339 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-12 17:12:16,340 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-12 17:12:16,342 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-12 17:12:16,347 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-12 17:12:16,347 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-12 17:12:16,347 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-12 17:12:16,348 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-12 17:12:16,348 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-12 17:12:16,349 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-12 17:12:16,349 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-12 17:12:16,350 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-12 17:12:16,351 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-12 17:12:16,351 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-12 17:12:16,352 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-12 17:12:16,352 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-12 17:12:16,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-12 17:12:16,353 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-12 17:12:16,353 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-12 17:12:16,353 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-12 17:12:16,354 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-12 17:12:16,357 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-06-12 17:12:16,385 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-12 17:12:16,385 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-12 17:12:16,385 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-12 17:12:16,385 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-12 17:12:16,387 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-12 17:12:16,387 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-12 17:12:16,387 INFO L138 SettingsManager]: * Use SBE=true [2021-06-12 17:12:16,388 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-12 17:12:16,388 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-12 17:12:16,388 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-12 17:12:16,388 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-12 17:12:16,389 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-12 17:12:16,389 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-12 17:12:16,389 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-12 17:12:16,389 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-12 17:12:16,389 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-12 17:12:16,389 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-12 17:12:16,389 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-12 17:12:16,389 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-12 17:12:16,390 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-12 17:12:16,390 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-12 17:12:16,390 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-12 17:12:16,390 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-12 17:12:16,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-12 17:12:16,390 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-12 17:12:16,390 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-12 17:12:16,390 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-12 17:12:16,391 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-12 17:12:16,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-12 17:12:16,391 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-12 17:12:16,391 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-12 17:12:16,391 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-12 17:12:16,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-12 17:12:16,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-12 17:12:16,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-12 17:12:16,633 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-12 17:12:16,634 INFO L275 PluginConnector]: CDTParser initialized [2021-06-12 17:12:16,634 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_pso.opt.i [2021-06-12 17:12:16,677 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b834ba5b/b3568abf003d4678b7139cd7c4b3157b/FLAG9d278b15d [2021-06-12 17:12:17,056 INFO L306 CDTParser]: Found 1 translation units. [2021-06-12 17:12:17,057 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_pso.opt.i [2021-06-12 17:12:17,074 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b834ba5b/b3568abf003d4678b7139cd7c4b3157b/FLAG9d278b15d [2021-06-12 17:12:17,450 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b834ba5b/b3568abf003d4678b7139cd7c4b3157b [2021-06-12 17:12:17,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-12 17:12:17,453 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-12 17:12:17,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-12 17:12:17,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-12 17:12:17,456 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-12 17:12:17,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.06 05:12:17" (1/1) ... [2021-06-12 17:12:17,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d3aa1ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:12:17, skipping insertion in model container [2021-06-12 17:12:17,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.06 05:12:17" (1/1) ... [2021-06-12 17:12:17,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-12 17:12:17,483 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-12 17:12:17,592 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/rfi003_pso.opt.i[991,1004] [2021-06-12 17:12:17,681 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-12 17:12:17,686 INFO L203 MainTranslator]: Completed pre-run [2021-06-12 17:12:17,693 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/rfi003_pso.opt.i[991,1004] [2021-06-12 17:12:17,721 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-12 17:12:17,761 INFO L208 MainTranslator]: Completed translation [2021-06-12 17:12:17,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:12:17 WrapperNode [2021-06-12 17:12:17,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-12 17:12:17,762 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-12 17:12:17,762 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-12 17:12:17,762 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-12 17:12:17,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:12:17" (1/1) ... [2021-06-12 17:12:17,775 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:12:17" (1/1) ... [2021-06-12 17:12:17,790 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-12 17:12:17,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-12 17:12:17,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-12 17:12:17,790 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-12 17:12:17,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:12:17" (1/1) ... [2021-06-12 17:12:17,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:12:17" (1/1) ... [2021-06-12 17:12:17,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:12:17" (1/1) ... [2021-06-12 17:12:17,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:12:17" (1/1) ... [2021-06-12 17:12:17,806 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:12:17" (1/1) ... [2021-06-12 17:12:17,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:12:17" (1/1) ... [2021-06-12 17:12:17,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:12:17" (1/1) ... [2021-06-12 17:12:17,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-12 17:12:17,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-12 17:12:17,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-12 17:12:17,825 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-12 17:12:17,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:12:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-12 17:12:17,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-12 17:12:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-12 17:12:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-12 17:12:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-12 17:12:17,932 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-12 17:12:17,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-12 17:12:17,934 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-12 17:12:17,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-12 17:12:17,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-12 17:12:17,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-12 17:12:17,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-12 17:12:17,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-12 17:12:17,935 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-12 17:12:19,095 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-12 17:12:19,096 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-12 17:12:19,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 05:12:19 BoogieIcfgContainer [2021-06-12 17:12:19,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-12 17:12:19,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-12 17:12:19,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-12 17:12:19,100 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-12 17:12:19,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.06 05:12:17" (1/3) ... [2021-06-12 17:12:19,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2936d702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 05:12:19, skipping insertion in model container [2021-06-12 17:12:19,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:12:17" (2/3) ... [2021-06-12 17:12:19,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2936d702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 05:12:19, skipping insertion in model container [2021-06-12 17:12:19,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 05:12:19" (3/3) ... [2021-06-12 17:12:19,103 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi003_pso.opt.i [2021-06-12 17:12:19,109 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-12 17:12:19,110 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-12 17:12:19,110 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-12 17:12:19,110 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-12 17:12:19,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,131 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,131 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,132 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,132 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,140 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,140 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,140 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,141 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,141 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,141 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,142 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,142 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,142 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,144 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,145 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,146 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,147 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,151 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,155 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,155 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,155 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,155 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,155 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,156 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,156 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,156 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,156 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,156 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,156 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,156 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,157 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,157 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,157 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,157 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,157 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,157 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,157 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,157 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,157 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,157 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,157 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,157 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,157 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,157 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,157 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,159 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,159 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,159 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,159 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:12:19,160 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-12 17:12:19,173 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-12 17:12:19,192 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 17:12:19,192 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 17:12:19,192 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 17:12:19,192 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 17:12:19,192 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 17:12:19,192 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 17:12:19,192 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 17:12:19,192 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1======== [2021-06-12 17:12:19,203 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 89 transitions, 188 flow [2021-06-12 17:12:19,282 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2012 states, 2008 states have (on average 2.7544820717131473) internal successors, (5531), 2011 states have internal predecessors, (5531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:12:19,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 2012 states, 2008 states have (on average 2.7544820717131473) internal successors, (5531), 2011 states have internal predecessors, (5531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:12:19,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-12 17:12:19,304 INFO L301 ceAbstractionStarter]: Result for error location P1 was SAFE (1/3) [2021-06-12 17:12:19,306 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-12 17:12:19,307 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 17:12:19,307 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 17:12:19,307 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 17:12:19,307 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 17:12:19,307 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 17:12:19,307 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 17:12:19,307 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 17:12:19,307 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-12 17:12:19,309 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 89 transitions, 188 flow [2021-06-12 17:12:19,336 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2012 states, 2008 states have (on average 2.7544820717131473) internal successors, (5531), 2011 states have internal predecessors, (5531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:12:19,338 INFO L276 IsEmpty]: Start isEmpty. Operand has 2012 states, 2008 states have (on average 2.7544820717131473) internal successors, (5531), 2011 states have internal predecessors, (5531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:12:19,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-06-12 17:12:19,341 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:12:19,341 INFO L472 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] [2021-06-12 17:12:19,342 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:12:19,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:12:19,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1234950876, now seen corresponding path program 1 times [2021-06-12 17:12:19,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:12:19,350 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551552382] [2021-06-12 17:12:19,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:12:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:12:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:12:19,606 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:12:19,607 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551552382] [2021-06-12 17:12:19,607 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551552382] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:12:19,608 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:12:19,608 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 17:12:19,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356019392] [2021-06-12 17:12:19,611 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 17:12:19,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:12:19,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 17:12:19,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 17:12:19,624 INFO L87 Difference]: Start difference. First operand has 2012 states, 2008 states have (on average 2.7544820717131473) internal successors, (5531), 2011 states have internal predecessors, (5531), 0 states have call successors, (0), 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 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:12:19,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:12:19,743 INFO L93 Difference]: Finished difference Result 2369 states and 6278 transitions. [2021-06-12 17:12:19,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 17:12:19,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2021-06-12 17:12:19,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:12:19,755 INFO L225 Difference]: With dead ends: 2369 [2021-06-12 17:12:19,756 INFO L226 Difference]: Without dead ends: 969 [2021-06-12 17:12:19,756 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 78.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-12 17:12:19,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2021-06-12 17:12:19,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 969. [2021-06-12 17:12:19,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 968 states have (on average 2.5557851239669422) internal successors, (2474), 968 states have internal predecessors, (2474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:12:19,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 2474 transitions. [2021-06-12 17:12:19,811 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 2474 transitions. Word has length 59 [2021-06-12 17:12:19,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:12:19,811 INFO L482 AbstractCegarLoop]: Abstraction has 969 states and 2474 transitions. [2021-06-12 17:12:19,812 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:12:19,815 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 2474 transitions. [2021-06-12 17:12:19,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-06-12 17:12:19,819 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:12:19,819 INFO L472 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] [2021-06-12 17:12:19,819 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-12 17:12:19,819 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:12:19,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:12:19,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1336413765, now seen corresponding path program 1 times [2021-06-12 17:12:19,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:12:19,820 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078633234] [2021-06-12 17:12:19,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:12:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:12:19,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:12:19,949 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:12:19,949 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078633234] [2021-06-12 17:12:19,950 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078633234] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:12:19,950 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:12:19,950 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-12 17:12:19,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055396537] [2021-06-12 17:12:19,951 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-12 17:12:19,951 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:12:19,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-12 17:12:19,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-12 17:12:19,952 INFO L87 Difference]: Start difference. First operand 969 states and 2474 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:12:20,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:12:20,098 INFO L93 Difference]: Finished difference Result 1360 states and 3433 transitions. [2021-06-12 17:12:20,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-12 17:12:20,099 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2021-06-12 17:12:20,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:12:20,102 INFO L225 Difference]: With dead ends: 1360 [2021-06-12 17:12:20,102 INFO L226 Difference]: Without dead ends: 704 [2021-06-12 17:12:20,103 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 123.8ms TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-06-12 17:12:20,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2021-06-12 17:12:20,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2021-06-12 17:12:20,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 703 states have (on average 2.462304409672831) internal successors, (1731), 703 states have internal predecessors, (1731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:12:20,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1731 transitions. [2021-06-12 17:12:20,120 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1731 transitions. Word has length 63 [2021-06-12 17:12:20,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:12:20,121 INFO L482 AbstractCegarLoop]: Abstraction has 704 states and 1731 transitions. [2021-06-12 17:12:20,121 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:12:20,121 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1731 transitions. [2021-06-12 17:12:20,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-06-12 17:12:20,122 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:12:20,122 INFO L472 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] [2021-06-12 17:12:20,122 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-12 17:12:20,122 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:12:20,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:12:20,122 INFO L82 PathProgramCache]: Analyzing trace with hash -2088086041, now seen corresponding path program 1 times [2021-06-12 17:12:20,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:12:20,123 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235462234] [2021-06-12 17:12:20,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:12:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:12:20,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:12:20,236 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:12:20,236 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235462234] [2021-06-12 17:12:20,236 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235462234] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:12:20,236 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:12:20,236 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 17:12:20,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545354252] [2021-06-12 17:12:20,237 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 17:12:20,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:12:20,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 17:12:20,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 17:12:20,237 INFO L87 Difference]: Start difference. First operand 704 states and 1731 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:12:20,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:12:20,333 INFO L93 Difference]: Finished difference Result 750 states and 1797 transitions. [2021-06-12 17:12:20,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 17:12:20,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2021-06-12 17:12:20,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:12:20,335 INFO L225 Difference]: With dead ends: 750 [2021-06-12 17:12:20,335 INFO L226 Difference]: Without dead ends: 530 [2021-06-12 17:12:20,335 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 85.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-12 17:12:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-06-12 17:12:20,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2021-06-12 17:12:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 529 states have (on average 2.3421550094517958) internal successors, (1239), 529 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:12:20,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1239 transitions. [2021-06-12 17:12:20,343 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1239 transitions. Word has length 66 [2021-06-12 17:12:20,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:12:20,343 INFO L482 AbstractCegarLoop]: Abstraction has 530 states and 1239 transitions. [2021-06-12 17:12:20,343 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:12:20,343 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1239 transitions. [2021-06-12 17:12:20,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-12 17:12:20,344 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:12:20,344 INFO L472 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] [2021-06-12 17:12:20,344 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-12 17:12:20,344 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:12:20,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:12:20,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1897801434, now seen corresponding path program 1 times [2021-06-12 17:12:20,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:12:20,345 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801044908] [2021-06-12 17:12:20,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:12:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:12:20,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:12:20,443 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:12:20,443 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801044908] [2021-06-12 17:12:20,444 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801044908] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:12:20,444 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:12:20,444 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-12 17:12:20,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324268127] [2021-06-12 17:12:20,444 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-12 17:12:20,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:12:20,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-12 17:12:20,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-12 17:12:20,445 INFO L87 Difference]: Start difference. First operand 530 states and 1239 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:12:20,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:12:20,515 INFO L93 Difference]: Finished difference Result 812 states and 1922 transitions. [2021-06-12 17:12:20,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-12 17:12:20,516 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2021-06-12 17:12:20,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:12:20,517 INFO L225 Difference]: With dead ends: 812 [2021-06-12 17:12:20,518 INFO L226 Difference]: Without dead ends: 517 [2021-06-12 17:12:20,518 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 55.1ms TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-06-12 17:12:20,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2021-06-12 17:12:20,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 514. [2021-06-12 17:12:20,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 513 states have (on average 2.341130604288499) internal successors, (1201), 513 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:12:20,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1201 transitions. [2021-06-12 17:12:20,526 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1201 transitions. Word has length 68 [2021-06-12 17:12:20,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:12:20,526 INFO L482 AbstractCegarLoop]: Abstraction has 514 states and 1201 transitions. [2021-06-12 17:12:20,526 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:12:20,526 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1201 transitions. [2021-06-12 17:12:20,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-06-12 17:12:20,527 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:12:20,527 INFO L472 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] [2021-06-12 17:12:20,527 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-12 17:12:20,527 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:12:20,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:12:20,527 INFO L82 PathProgramCache]: Analyzing trace with hash -666104826, now seen corresponding path program 1 times [2021-06-12 17:12:20,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:12:20,528 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553028136] [2021-06-12 17:12:20,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:12:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:12:20,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:12:20,614 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:12:20,614 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553028136] [2021-06-12 17:12:20,614 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553028136] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:12:20,614 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:12:20,614 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-12 17:12:20,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628828202] [2021-06-12 17:12:20,615 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-12 17:12:20,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:12:20,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-12 17:12:20,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-12 17:12:20,615 INFO L87 Difference]: Start difference. First operand 514 states and 1201 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:12:20,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:12:20,718 INFO L93 Difference]: Finished difference Result 436 states and 972 transitions. [2021-06-12 17:12:20,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-12 17:12:20,719 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2021-06-12 17:12:20,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:12:20,720 INFO L225 Difference]: With dead ends: 436 [2021-06-12 17:12:20,720 INFO L226 Difference]: Without dead ends: 316 [2021-06-12 17:12:20,720 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 95.4ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-12 17:12:20,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-06-12 17:12:20,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 301. [2021-06-12 17:12:20,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 2.12) internal successors, (636), 300 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:12:20,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 636 transitions. [2021-06-12 17:12:20,725 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 636 transitions. Word has length 68 [2021-06-12 17:12:20,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:12:20,725 INFO L482 AbstractCegarLoop]: Abstraction has 301 states and 636 transitions. [2021-06-12 17:12:20,725 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:12:20,725 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 636 transitions. [2021-06-12 17:12:20,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-12 17:12:20,725 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:12:20,725 INFO L472 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] [2021-06-12 17:12:20,726 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-12 17:12:20,726 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:12:20,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:12:20,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1865162275, now seen corresponding path program 1 times [2021-06-12 17:12:20,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:12:20,726 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462226598] [2021-06-12 17:12:20,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:12:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:12:20,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:12:20,911 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:12:20,911 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462226598] [2021-06-12 17:12:20,913 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462226598] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:12:20,913 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:12:20,913 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-06-12 17:12:20,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073315178] [2021-06-12 17:12:20,914 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-12 17:12:20,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:12:20,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-12 17:12:20,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-06-12 17:12:20,914 INFO L87 Difference]: Start difference. First operand 301 states and 636 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:12:21,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:12:21,054 INFO L93 Difference]: Finished difference Result 439 states and 950 transitions. [2021-06-12 17:12:21,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-12 17:12:21,054 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2021-06-12 17:12:21,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:12:21,055 INFO L225 Difference]: With dead ends: 439 [2021-06-12 17:12:21,055 INFO L226 Difference]: Without dead ends: 265 [2021-06-12 17:12:21,055 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 141.1ms TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-06-12 17:12:21,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2021-06-12 17:12:21,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2021-06-12 17:12:21,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 2.0454545454545454) internal successors, (540), 264 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:12:21,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 540 transitions. [2021-06-12 17:12:21,059 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 540 transitions. Word has length 70 [2021-06-12 17:12:21,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:12:21,059 INFO L482 AbstractCegarLoop]: Abstraction has 265 states and 540 transitions. [2021-06-12 17:12:21,059 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:12:21,059 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 540 transitions. [2021-06-12 17:12:21,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-12 17:12:21,060 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:12:21,060 INFO L472 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] [2021-06-12 17:12:21,060 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-12 17:12:21,060 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:12:21,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:12:21,060 INFO L82 PathProgramCache]: Analyzing trace with hash -678410717, now seen corresponding path program 2 times [2021-06-12 17:12:21,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:12:21,061 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710367965] [2021-06-12 17:12:21,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:12:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-12 17:12:21,082 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-12 17:12:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-12 17:12:21,106 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-12 17:12:21,138 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-12 17:12:21,138 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-12 17:12:21,138 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-12 17:12:21,139 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/3) [2021-06-12 17:12:21,140 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-12 17:12:21,140 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 17:12:21,140 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 17:12:21,140 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 17:12:21,140 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 17:12:21,140 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 17:12:21,140 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 17:12:21,141 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 17:12:21,141 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1Thread1of1ForFork1======== [2021-06-12 17:12:21,143 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 89 transitions, 188 flow [2021-06-12 17:12:21,173 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2012 states, 2008 states have (on average 2.7544820717131473) internal successors, (5531), 2011 states have internal predecessors, (5531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:12:21,184 INFO L276 IsEmpty]: Start isEmpty. Operand has 2012 states, 2008 states have (on average 2.7544820717131473) internal successors, (5531), 2011 states have internal predecessors, (5531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:12:21,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-06-12 17:12:21,185 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:12:21,185 INFO L472 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] [2021-06-12 17:12:21,185 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:12:21,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:12:21,185 INFO L82 PathProgramCache]: Analyzing trace with hash 875694269, now seen corresponding path program 1 times [2021-06-12 17:12:21,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:12:21,185 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932149896] [2021-06-12 17:12:21,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:12:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:12:21,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:12:21,211 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:12:21,212 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932149896] [2021-06-12 17:12:21,212 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932149896] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:12:21,212 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:12:21,212 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-12 17:12:21,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140904946] [2021-06-12 17:12:21,212 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-12 17:12:21,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:12:21,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-12 17:12:21,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 17:12:21,216 INFO L87 Difference]: Start difference. First operand has 2012 states, 2008 states have (on average 2.7544820717131473) internal successors, (5531), 2011 states have internal predecessors, (5531), 0 states have call successors, (0), 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 23.5) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:12:21,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:12:21,234 INFO L93 Difference]: Finished difference Result 1767 states and 4691 transitions. [2021-06-12 17:12:21,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-12 17:12:21,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2021-06-12 17:12:21,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:12:21,235 INFO L225 Difference]: With dead ends: 1767 [2021-06-12 17:12:21,235 INFO L226 Difference]: Without dead ends: 0 [2021-06-12 17:12:21,235 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-12 17:12:21,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-12 17:12:21,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-12 17:12:21,236 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-06-12 17:12:21,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-12 17:12:21,236 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2021-06-12 17:12:21,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:12:21,236 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-12 17:12:21,236 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:12:21,236 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-12 17:12:21,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-12 17:12:21,236 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-12 17:12:21,236 INFO L301 ceAbstractionStarter]: Result for error location P1Thread1of1ForFork1 was SAFE (3/3) [2021-06-12 17:12:21,237 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-12 17:12:21,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.06 05:12:21 BasicIcfg [2021-06-12 17:12:21,310 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-12 17:12:21,311 INFO L168 Benchmark]: Toolchain (without parser) took 3858.28 ms. Allocated memory was 202.4 MB in the beginning and 298.8 MB in the end (delta: 96.5 MB). Free memory was 165.1 MB in the beginning and 186.5 MB in the end (delta: -21.5 MB). Peak memory consumption was 75.2 MB. Max. memory is 8.0 GB. [2021-06-12 17:12:21,311 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 202.4 MB. Free memory is still 183.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-12 17:12:21,311 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.13 ms. Allocated memory is still 202.4 MB. Free memory was 164.9 MB in the beginning and 160.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2021-06-12 17:12:21,312 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.71 ms. Allocated memory is still 202.4 MB. Free memory was 160.7 MB in the beginning and 158.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-06-12 17:12:21,312 INFO L168 Benchmark]: Boogie Preprocessor took 34.59 ms. Allocated memory is still 202.4 MB. Free memory was 158.6 MB in the beginning and 156.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-06-12 17:12:21,312 INFO L168 Benchmark]: RCFGBuilder took 1272.31 ms. Allocated memory is still 202.4 MB. Free memory was 156.5 MB in the beginning and 94.4 MB in the end (delta: 62.1 MB). Peak memory consumption was 92.0 MB. Max. memory is 8.0 GB. [2021-06-12 17:12:21,312 INFO L168 Benchmark]: TraceAbstraction took 2211.98 ms. Allocated memory was 202.4 MB in the beginning and 298.8 MB in the end (delta: 96.5 MB). Free memory was 93.9 MB in the beginning and 186.5 MB in the end (delta: -92.6 MB). Peak memory consumption was 3.3 MB. Max. memory is 8.0 GB. [2021-06-12 17:12:21,314 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.11 ms. Allocated memory is still 202.4 MB. Free memory is still 183.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 308.13 ms. Allocated memory is still 202.4 MB. Free memory was 164.9 MB in the beginning and 160.7 MB in the end (delta: 4.2 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 27.71 ms. Allocated memory is still 202.4 MB. Free memory was 160.7 MB in the beginning and 158.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 34.59 ms. Allocated memory is still 202.4 MB. Free memory was 158.6 MB in the beginning and 156.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1272.31 ms. Allocated memory is still 202.4 MB. Free memory was 156.5 MB in the beginning and 94.4 MB in the end (delta: 62.1 MB). Peak memory consumption was 92.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 2211.98 ms. Allocated memory was 202.4 MB in the beginning and 298.8 MB in the end (delta: 96.5 MB). Free memory was 93.9 MB in the beginning and 186.5 MB in the end (delta: -92.6 MB). Peak memory consumption was 3.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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L713] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L716] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L717] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L719] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L720] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L721] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L722] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L723] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L724] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L725] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L726] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L727] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L728] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L729] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L730] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L731] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L732] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L733] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L735] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L813] 0 pthread_t t1639; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L814] FCALL, FORK 0 pthread_create(&t1639, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L815] 0 pthread_t t1640; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L816] FCALL, FORK 0 pthread_create(&t1640, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L782] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] 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) [L750] 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) [L751] 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)) [L751] 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) [L751] 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)) [L751] 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)) [L752] 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)) [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_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L752] 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)) [L752] 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)) [L753] 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)) [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_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L753] 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)) [L753] 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)) [L754] 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)) [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_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L754] 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)) [L754] 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)) [L755] 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)) [L755] 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) [L755] 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)) [L755] 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)) [L756] 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)) [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_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L756] 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)) [L756] 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)) [L757] 1 __unbuffered_p0_EAX = x [L758] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L791] 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) [L791] 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) [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 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 [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L795] 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 [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L822] 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) [L822] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L822] 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) [L822] 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) [L823] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L824] 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 [L825] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L826] 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 [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] 0 reach_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, 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: P1 with 1 thread instances CFG has 5 procedures, 108 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 114.2ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 22.2ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 89.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2012occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: 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 5 procedures, 108 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1831.6ms, OverallIterations: 7, TraceHistogramMax: 1, EmptinessCheckTime: 12.6ms, AutomataDifference: 715.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 28.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 600 SDtfs, 807 SDslu, 2013 SDs, 0 SdLazy, 227 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 164.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 579.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2012occurred in iteration=0, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 86.9ms AutomataMinimizationTime, 6 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 25.6ms SsaConstructionTime, 244.4ms SatisfiabilityAnalysisTime, 549.1ms InterpolantComputationTime, 464 NumberOfCodeBlocks, 464 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 388 ConstructedInterpolants, 0 QuantifiedInterpolants, 1478 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 108 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 96.0ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 11.7ms, AutomataDifference: 23.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 32.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 80 SDtfs, 27 SDslu, 58 SDs, 0 SdLazy, 7 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2012occurred 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: 0.3ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0ms SsaConstructionTime, 3.2ms SatisfiabilityAnalysisTime, 18.5ms InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 46 ConstructedInterpolants, 0 QuantifiedInterpolants, 88 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 RESULT: Ultimate proved your program to be incorrect! Received shutdown request...