/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-Delay.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-87fd7473a0bda1db0ad7f77f2116346063730f21-87fd747 [2021-08-21 17:11:59,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-21 17:11:59,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-21 17:11:59,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-21 17:11:59,511 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-21 17:11:59,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-21 17:11:59,516 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-21 17:11:59,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-21 17:11:59,524 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-21 17:11:59,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-21 17:11:59,529 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-21 17:11:59,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-21 17:11:59,531 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-21 17:11:59,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-21 17:11:59,534 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-21 17:11:59,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-21 17:11:59,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-21 17:11:59,539 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-21 17:11:59,542 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-21 17:11:59,549 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-21 17:11:59,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-21 17:11:59,553 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-21 17:11:59,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-21 17:11:59,556 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-21 17:11:59,562 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-21 17:11:59,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-21 17:11:59,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-21 17:11:59,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-21 17:11:59,564 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-21 17:11:59,565 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-21 17:11:59,565 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-21 17:11:59,565 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-21 17:11:59,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-21 17:11:59,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-21 17:11:59,569 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-21 17:11:59,569 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-21 17:11:59,569 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-21 17:11:59,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-21 17:11:59,570 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-21 17:11:59,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-21 17:11:59,571 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-21 17:11:59,575 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-Delay.epf [2021-08-21 17:11:59,607 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-21 17:11:59,608 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-21 17:11:59,611 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-21 17:11:59,611 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-21 17:11:59,611 INFO L138 SettingsManager]: * Use SBE=true [2021-08-21 17:11:59,611 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-21 17:11:59,611 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-21 17:11:59,612 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-21 17:11:59,612 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-21 17:11:59,612 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-21 17:11:59,612 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-21 17:11:59,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-21 17:11:59,613 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-21 17:11:59,613 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-21 17:11:59,613 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-21 17:11:59,613 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-21 17:11:59,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-21 17:11:59,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-21 17:11:59,614 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-21 17:11:59,614 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-21 17:11:59,614 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-21 17:11:59,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 17:11:59,614 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-21 17:11:59,614 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-21 17:11:59,614 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-21 17:11:59,615 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-21 17:11:59,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-21 17:11:59,615 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-21 17:11:59,615 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-21 17:11:59,615 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-08-21 17:11:59,616 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-08-21 17:11:59,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-21 17:11:59,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-21 17:11:59,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-21 17:11:59,984 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-21 17:11:59,985 INFO L275 PluginConnector]: CDTParser initialized [2021-08-21 17:11:59,986 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_rmo.opt.i [2021-08-21 17:12:00,051 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1146a4946/34ea22afd68d40028d28ab8a4bf7e85b/FLAGb25fbdd6f [2021-08-21 17:12:00,571 INFO L306 CDTParser]: Found 1 translation units. [2021-08-21 17:12:00,572 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_rmo.opt.i [2021-08-21 17:12:00,592 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1146a4946/34ea22afd68d40028d28ab8a4bf7e85b/FLAGb25fbdd6f [2021-08-21 17:12:01,083 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1146a4946/34ea22afd68d40028d28ab8a4bf7e85b [2021-08-21 17:12:01,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-21 17:12:01,086 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-21 17:12:01,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-21 17:12:01,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-21 17:12:01,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-21 17:12:01,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 05:12:01" (1/1) ... [2021-08-21 17:12:01,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f5b704e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:01, skipping insertion in model container [2021-08-21 17:12:01,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 05:12:01" (1/1) ... [2021-08-21 17:12:01,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-21 17:12:01,206 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-21 17:12:01,505 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_rmo.opt.i[992,1005] [2021-08-21 17:12:01,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 17:12:01,766 INFO L203 MainTranslator]: Completed pre-run [2021-08-21 17:12:01,782 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_rmo.opt.i[992,1005] [2021-08-21 17:12:01,825 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 17:12:01,855 INFO L208 MainTranslator]: Completed translation [2021-08-21 17:12:01,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:01 WrapperNode [2021-08-21 17:12:01,856 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-21 17:12:01,857 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-21 17:12:01,857 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-21 17:12:01,857 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-21 17:12:01,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:01" (1/1) ... [2021-08-21 17:12:01,894 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:01" (1/1) ... [2021-08-21 17:12:01,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-21 17:12:01,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-21 17:12:01,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-21 17:12:01,923 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-21 17:12:01,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:01" (1/1) ... [2021-08-21 17:12:01,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:01" (1/1) ... [2021-08-21 17:12:01,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:01" (1/1) ... [2021-08-21 17:12:01,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:01" (1/1) ... [2021-08-21 17:12:01,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:01" (1/1) ... [2021-08-21 17:12:01,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:01" (1/1) ... [2021-08-21 17:12:01,953 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:01" (1/1) ... [2021-08-21 17:12:01,957 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-21 17:12:01,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-21 17:12:01,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-21 17:12:01,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-21 17:12:01,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:01" (1/1) ... [2021-08-21 17:12:01,964 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 17:12:01,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-21 17:12:01,981 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-21 17:12:02,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-21 17:12:02,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-21 17:12:02,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-21 17:12:02,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-21 17:12:02,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-21 17:12:02,022 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-21 17:12:02,022 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-21 17:12:02,023 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-21 17:12:02,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-21 17:12:02,023 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-21 17:12:02,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-21 17:12:02,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-21 17:12:02,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-21 17:12:02,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-21 17:12:02,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-21 17:12:02,026 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-21 17:12:05,861 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-21 17:12:05,861 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-21 17:12:05,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 05:12:05 BoogieIcfgContainer [2021-08-21 17:12:05,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-21 17:12:05,865 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-21 17:12:05,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-21 17:12:05,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-21 17:12:05,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 05:12:01" (1/3) ... [2021-08-21 17:12:05,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3692325f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 05:12:05, skipping insertion in model container [2021-08-21 17:12:05,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:12:01" (2/3) ... [2021-08-21 17:12:05,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3692325f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 05:12:05, skipping insertion in model container [2021-08-21 17:12:05,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 05:12:05" (3/3) ... [2021-08-21 17:12:05,869 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_rmo.opt.i [2021-08-21 17:12:05,873 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-21 17:12:05,874 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-21 17:12:05,874 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-21 17:12:05,874 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-21 17:12:05,931 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,932 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,932 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,932 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,932 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,932 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,933 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,933 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,933 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,933 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,933 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,933 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,933 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,933 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,939 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,939 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,939 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,940 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,941 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,942 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,943 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,943 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,943 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,943 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,943 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,943 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,943 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,943 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,946 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,947 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,947 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,947 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,947 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,947 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,947 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,947 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,948 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,948 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,948 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,948 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,948 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,948 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,948 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,949 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,949 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,949 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,949 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,949 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,949 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,949 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,950 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,950 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,950 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,950 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,950 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,950 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,951 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,952 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,953 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,954 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,954 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,954 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,954 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,962 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,963 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,965 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,965 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,965 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,965 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,965 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,966 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,966 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,966 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,974 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,976 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,977 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,977 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,977 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,979 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,979 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,980 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,980 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,980 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,981 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,987 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,988 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,988 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,988 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,989 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,989 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,989 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,990 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,990 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,990 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,990 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,990 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,990 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,990 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,990 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,990 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,994 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,994 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,995 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,995 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,995 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,995 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,995 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,995 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,995 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,995 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,995 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,996 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,996 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,996 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,996 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,996 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:12:05,999 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-21 17:12:06,043 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-21 17:12:06,057 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-21 17:12:06,057 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-21 17:12:08,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 11680 states, 10385 states have (on average 2.360712566201252) internal successors, (24516), 11679 states have internal predecessors, (24516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:08,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-08-21 17:12:08,119 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:12:08,120 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:12:08,120 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:12:08,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:12:08,125 INFO L82 PathProgramCache]: Analyzing trace with hash -2112839515, now seen corresponding path program 1 times [2021-08-21 17:12:08,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:12:08,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038740288] [2021-08-21 17:12:08,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:12:08,133 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:12:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:12:08,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:12:08,457 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:12:08,457 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038740288] [2021-08-21 17:12:08,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038740288] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:12:08,458 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:12:08,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-21 17:12:08,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084519398] [2021-08-21 17:12:08,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-21 17:12:08,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:12:08,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-21 17:12:08,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 17:12:08,499 INFO L87 Difference]: Start difference. First operand has 11680 states, 10385 states have (on average 2.360712566201252) internal successors, (24516), 11679 states have internal predecessors, (24516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:08,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:12:08,673 INFO L93 Difference]: Finished difference Result 9853 states and 20041 transitions. [2021-08-21 17:12:08,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-21 17:12:08,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-08-21 17:12:08,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:12:08,719 INFO L225 Difference]: With dead ends: 9853 [2021-08-21 17:12:08,720 INFO L226 Difference]: Without dead ends: 5263 [2021-08-21 17:12:08,721 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 17:12:08,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2021-08-21 17:12:08,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 5263. [2021-08-21 17:12:09,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5263 states, 5207 states have (on average 2.4993278279239486) internal successors, (13014), 5262 states have internal predecessors, (13014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:09,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5263 states to 5263 states and 13014 transitions. [2021-08-21 17:12:09,036 INFO L78 Accepts]: Start accepts. Automaton has 5263 states and 13014 transitions. Word has length 55 [2021-08-21 17:12:09,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:12:09,037 INFO L470 AbstractCegarLoop]: Abstraction has 5263 states and 13014 transitions. [2021-08-21 17:12:09,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:09,037 INFO L276 IsEmpty]: Start isEmpty. Operand 5263 states and 13014 transitions. [2021-08-21 17:12:09,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-21 17:12:09,049 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:12:09,049 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:12:09,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-21 17:12:09,050 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:12:09,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:12:09,052 INFO L82 PathProgramCache]: Analyzing trace with hash 2032541159, now seen corresponding path program 1 times [2021-08-21 17:12:09,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:12:09,052 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638067703] [2021-08-21 17:12:09,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:12:09,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:12:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:12:09,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:12:09,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:12:09,362 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638067703] [2021-08-21 17:12:09,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638067703] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:12:09,362 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:12:09,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 17:12:09,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64825006] [2021-08-21 17:12:09,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 17:12:09,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:12:09,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 17:12:09,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 17:12:09,365 INFO L87 Difference]: Start difference. First operand 5263 states and 13014 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:09,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:12:09,563 INFO L93 Difference]: Finished difference Result 6567 states and 16565 transitions. [2021-08-21 17:12:09,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 17:12:09,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-08-21 17:12:09,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:12:09,592 INFO L225 Difference]: With dead ends: 6567 [2021-08-21 17:12:09,593 INFO L226 Difference]: Without dead ends: 4915 [2021-08-21 17:12:09,593 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 130.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 17:12:09,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4915 states. [2021-08-21 17:12:09,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4915 to 4915. [2021-08-21 17:12:09,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4915 states, 4865 states have (on average 2.5130524152106886) internal successors, (12226), 4914 states have internal predecessors, (12226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:09,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4915 states to 4915 states and 12226 transitions. [2021-08-21 17:12:09,737 INFO L78 Accepts]: Start accepts. Automaton has 4915 states and 12226 transitions. Word has length 67 [2021-08-21 17:12:09,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:12:09,738 INFO L470 AbstractCegarLoop]: Abstraction has 4915 states and 12226 transitions. [2021-08-21 17:12:09,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:09,738 INFO L276 IsEmpty]: Start isEmpty. Operand 4915 states and 12226 transitions. [2021-08-21 17:12:09,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-21 17:12:09,802 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:12:09,802 INFO L512 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] [2021-08-21 17:12:09,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-21 17:12:09,803 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:12:09,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:12:09,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1763481400, now seen corresponding path program 1 times [2021-08-21 17:12:09,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:12:09,804 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086398419] [2021-08-21 17:12:09,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:12:09,804 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:12:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:12:10,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:12:10,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:12:10,026 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086398419] [2021-08-21 17:12:10,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086398419] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:12:10,027 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:12:10,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 17:12:10,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036365108] [2021-08-21 17:12:10,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 17:12:10,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:12:10,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 17:12:10,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 17:12:10,035 INFO L87 Difference]: Start difference. First operand 4915 states and 12226 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:10,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:12:10,231 INFO L93 Difference]: Finished difference Result 5115 states and 12894 transitions. [2021-08-21 17:12:10,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 17:12:10,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2021-08-21 17:12:10,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:12:10,252 INFO L225 Difference]: With dead ends: 5115 [2021-08-21 17:12:10,252 INFO L226 Difference]: Without dead ends: 3715 [2021-08-21 17:12:10,252 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 140.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 17:12:10,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3715 states. [2021-08-21 17:12:10,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3715 to 3715. [2021-08-21 17:12:10,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3715 states, 3665 states have (on average 2.450204638472033) internal successors, (8980), 3714 states have internal predecessors, (8980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:10,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3715 states to 3715 states and 8980 transitions. [2021-08-21 17:12:10,367 INFO L78 Accepts]: Start accepts. Automaton has 3715 states and 8980 transitions. Word has length 69 [2021-08-21 17:12:10,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:12:10,368 INFO L470 AbstractCegarLoop]: Abstraction has 3715 states and 8980 transitions. [2021-08-21 17:12:10,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:10,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3715 states and 8980 transitions. [2021-08-21 17:12:10,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-21 17:12:10,375 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:12:10,375 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:12:10,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-21 17:12:10,376 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:12:10,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:12:10,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1785918346, now seen corresponding path program 1 times [2021-08-21 17:12:10,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:12:10,377 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225517593] [2021-08-21 17:12:10,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:12:10,377 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:12:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:12:10,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:12:10,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:12:10,685 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225517593] [2021-08-21 17:12:10,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225517593] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:12:10,685 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:12:10,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-21 17:12:10,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558047643] [2021-08-21 17:12:10,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-21 17:12:10,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:12:10,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-21 17:12:10,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-21 17:12:10,687 INFO L87 Difference]: Start difference. First operand 3715 states and 8980 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:11,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:12:11,304 INFO L93 Difference]: Finished difference Result 4207 states and 10441 transitions. [2021-08-21 17:12:11,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-21 17:12:11,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-08-21 17:12:11,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:12:11,322 INFO L225 Difference]: With dead ends: 4207 [2021-08-21 17:12:11,323 INFO L226 Difference]: Without dead ends: 3727 [2021-08-21 17:12:11,323 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 373.2ms TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2021-08-21 17:12:11,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3727 states. [2021-08-21 17:12:11,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3727 to 3725. [2021-08-21 17:12:11,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3725 states, 3675 states have (on average 2.449795918367347) internal successors, (9003), 3724 states have internal predecessors, (9003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:11,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3725 states to 3725 states and 9003 transitions. [2021-08-21 17:12:11,401 INFO L78 Accepts]: Start accepts. Automaton has 3725 states and 9003 transitions. Word has length 73 [2021-08-21 17:12:11,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:12:11,402 INFO L470 AbstractCegarLoop]: Abstraction has 3725 states and 9003 transitions. [2021-08-21 17:12:11,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:11,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3725 states and 9003 transitions. [2021-08-21 17:12:11,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-21 17:12:11,408 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:12:11,409 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:12:11,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-21 17:12:11,409 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:12:11,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:12:11,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1432763236, now seen corresponding path program 2 times [2021-08-21 17:12:11,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:12:11,410 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606586458] [2021-08-21 17:12:11,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:12:11,410 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:12:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:12:11,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:12:11,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:12:11,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606586458] [2021-08-21 17:12:11,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606586458] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:12:11,930 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:12:11,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-21 17:12:11,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022018014] [2021-08-21 17:12:11,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-21 17:12:11,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:12:11,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-21 17:12:11,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-08-21 17:12:11,932 INFO L87 Difference]: Start difference. First operand 3725 states and 9003 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:12,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:12:12,480 INFO L93 Difference]: Finished difference Result 4005 states and 9903 transitions. [2021-08-21 17:12:12,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-21 17:12:12,481 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2021-08-21 17:12:12,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:12:12,492 INFO L225 Difference]: With dead ends: 4005 [2021-08-21 17:12:12,492 INFO L226 Difference]: Without dead ends: 3268 [2021-08-21 17:12:12,493 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 337.1ms TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2021-08-21 17:12:12,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3268 states. [2021-08-21 17:12:12,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3268 to 3263. [2021-08-21 17:12:12,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3263 states, 3223 states have (on average 2.471610300961837) internal successors, (7966), 3262 states have internal predecessors, (7966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:12,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3263 states to 3263 states and 7966 transitions. [2021-08-21 17:12:12,568 INFO L78 Accepts]: Start accepts. Automaton has 3263 states and 7966 transitions. Word has length 73 [2021-08-21 17:12:12,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:12:12,568 INFO L470 AbstractCegarLoop]: Abstraction has 3263 states and 7966 transitions. [2021-08-21 17:12:12,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:12,569 INFO L276 IsEmpty]: Start isEmpty. Operand 3263 states and 7966 transitions. [2021-08-21 17:12:12,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-21 17:12:12,575 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:12:12,575 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:12:12,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-21 17:12:12,575 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:12:12,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:12:12,576 INFO L82 PathProgramCache]: Analyzing trace with hash -498989227, now seen corresponding path program 1 times [2021-08-21 17:12:12,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:12:12,576 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864920193] [2021-08-21 17:12:12,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:12:12,576 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:12:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:12:12,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:12:12,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:12:12,731 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864920193] [2021-08-21 17:12:12,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864920193] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:12:12,731 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:12:12,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 17:12:12,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571426519] [2021-08-21 17:12:12,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 17:12:12,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:12:12,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 17:12:12,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 17:12:12,733 INFO L87 Difference]: Start difference. First operand 3263 states and 7966 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:12,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:12:12,899 INFO L93 Difference]: Finished difference Result 5508 states and 14150 transitions. [2021-08-21 17:12:12,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 17:12:12,900 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2021-08-21 17:12:12,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:12:12,910 INFO L225 Difference]: With dead ends: 5508 [2021-08-21 17:12:12,911 INFO L226 Difference]: Without dead ends: 3101 [2021-08-21 17:12:12,911 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 125.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 17:12:12,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3101 states. [2021-08-21 17:12:12,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3101 to 2601. [2021-08-21 17:12:12,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2601 states, 2571 states have (on average 2.4721898094126797) internal successors, (6356), 2600 states have internal predecessors, (6356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:12,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2601 states to 2601 states and 6356 transitions. [2021-08-21 17:12:12,972 INFO L78 Accepts]: Start accepts. Automaton has 2601 states and 6356 transitions. Word has length 74 [2021-08-21 17:12:12,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:12:12,972 INFO L470 AbstractCegarLoop]: Abstraction has 2601 states and 6356 transitions. [2021-08-21 17:12:12,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:12,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2601 states and 6356 transitions. [2021-08-21 17:12:12,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-21 17:12:12,978 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:12:12,978 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:12:12,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-21 17:12:12,979 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:12:12,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:12:12,979 INFO L82 PathProgramCache]: Analyzing trace with hash -440845844, now seen corresponding path program 1 times [2021-08-21 17:12:12,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:12:12,979 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691775402] [2021-08-21 17:12:12,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:12:12,980 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:12:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:12:13,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:12:13,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:12:13,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691775402] [2021-08-21 17:12:13,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691775402] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:12:13,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:12:13,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-21 17:12:13,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522607297] [2021-08-21 17:12:13,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-21 17:12:13,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:12:13,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-21 17:12:13,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-08-21 17:12:13,408 INFO L87 Difference]: Start difference. First operand 2601 states and 6356 transitions. Second operand has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:14,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:12:14,064 INFO L93 Difference]: Finished difference Result 5425 states and 14264 transitions. [2021-08-21 17:12:14,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-21 17:12:14,072 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-08-21 17:12:14,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:12:14,081 INFO L225 Difference]: With dead ends: 5425 [2021-08-21 17:12:14,081 INFO L226 Difference]: Without dead ends: 2689 [2021-08-21 17:12:14,081 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 405.8ms TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2021-08-21 17:12:14,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2689 states. [2021-08-21 17:12:14,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2689 to 2293. [2021-08-21 17:12:14,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2293 states, 2263 states have (on average 2.4295183384887316) internal successors, (5498), 2292 states have internal predecessors, (5498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:14,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 5498 transitions. [2021-08-21 17:12:14,128 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 5498 transitions. Word has length 75 [2021-08-21 17:12:14,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:12:14,129 INFO L470 AbstractCegarLoop]: Abstraction has 2293 states and 5498 transitions. [2021-08-21 17:12:14,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.818181818181818) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:14,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 5498 transitions. [2021-08-21 17:12:14,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-21 17:12:14,133 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:12:14,134 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:12:14,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-21 17:12:14,134 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:12:14,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:12:14,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1349296326, now seen corresponding path program 2 times [2021-08-21 17:12:14,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:12:14,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19980078] [2021-08-21 17:12:14,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:12:14,135 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:12:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:12:14,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:12:14,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:12:14,681 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19980078] [2021-08-21 17:12:14,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19980078] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:12:14,681 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:12:14,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-21 17:12:14,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166351606] [2021-08-21 17:12:14,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-21 17:12:14,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:12:14,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-21 17:12:14,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-08-21 17:12:14,682 INFO L87 Difference]: Start difference. First operand 2293 states and 5498 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:15,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:12:15,303 INFO L93 Difference]: Finished difference Result 2971 states and 7367 transitions. [2021-08-21 17:12:15,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-21 17:12:15,304 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-08-21 17:12:15,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:12:15,312 INFO L225 Difference]: With dead ends: 2971 [2021-08-21 17:12:15,312 INFO L226 Difference]: Without dead ends: 2435 [2021-08-21 17:12:15,313 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 330.7ms TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2021-08-21 17:12:15,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2021-08-21 17:12:15,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 2337. [2021-08-21 17:12:15,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2337 states, 2307 states have (on average 2.413524057217165) internal successors, (5568), 2336 states have internal predecessors, (5568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:15,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 5568 transitions. [2021-08-21 17:12:15,360 INFO L78 Accepts]: Start accepts. Automaton has 2337 states and 5568 transitions. Word has length 75 [2021-08-21 17:12:15,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:12:15,361 INFO L470 AbstractCegarLoop]: Abstraction has 2337 states and 5568 transitions. [2021-08-21 17:12:15,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 13 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:15,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 5568 transitions. [2021-08-21 17:12:15,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-08-21 17:12:15,365 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:12:15,365 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:12:15,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-21 17:12:15,366 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:12:15,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:12:15,366 INFO L82 PathProgramCache]: Analyzing trace with hash 867671952, now seen corresponding path program 3 times [2021-08-21 17:12:15,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:12:15,366 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092020918] [2021-08-21 17:12:15,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:12:15,367 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:12:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:12:15,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:12:15,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:12:15,990 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092020918] [2021-08-21 17:12:15,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092020918] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:12:15,990 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:12:15,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-21 17:12:15,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130598621] [2021-08-21 17:12:15,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-21 17:12:15,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:12:15,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-21 17:12:15,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2021-08-21 17:12:15,991 INFO L87 Difference]: Start difference. First operand 2337 states and 5568 transitions. Second operand has 15 states, 15 states have (on average 5.0) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:16,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:12:16,899 INFO L93 Difference]: Finished difference Result 3173 states and 7777 transitions. [2021-08-21 17:12:16,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-21 17:12:16,900 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.0) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2021-08-21 17:12:16,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:12:16,910 INFO L225 Difference]: With dead ends: 3173 [2021-08-21 17:12:16,910 INFO L226 Difference]: Without dead ends: 2581 [2021-08-21 17:12:16,910 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 688.5ms TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2021-08-21 17:12:16,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2581 states. [2021-08-21 17:12:16,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2581 to 2332. [2021-08-21 17:12:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2332 states, 2302 states have (on average 2.4061685490877496) internal successors, (5539), 2331 states have internal predecessors, (5539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:16,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 5539 transitions. [2021-08-21 17:12:16,969 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 5539 transitions. Word has length 75 [2021-08-21 17:12:16,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:12:16,970 INFO L470 AbstractCegarLoop]: Abstraction has 2332 states and 5539 transitions. [2021-08-21 17:12:16,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.0) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:16,970 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 5539 transitions. [2021-08-21 17:12:16,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-21 17:12:16,975 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:12:16,975 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:12:16,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-21 17:12:16,975 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:12:16,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:12:16,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1878412927, now seen corresponding path program 1 times [2021-08-21 17:12:16,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:12:16,976 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739423130] [2021-08-21 17:12:16,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:12:16,976 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:12:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:12:17,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:12:17,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:12:17,328 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739423130] [2021-08-21 17:12:17,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739423130] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:12:17,328 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:12:17,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-21 17:12:17,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052342317] [2021-08-21 17:12:17,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-21 17:12:17,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:12:17,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-21 17:12:17,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-08-21 17:12:17,333 INFO L87 Difference]: Start difference. First operand 2332 states and 5539 transitions. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:18,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:12:18,061 INFO L93 Difference]: Finished difference Result 3766 states and 9176 transitions. [2021-08-21 17:12:18,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-21 17:12:18,062 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-08-21 17:12:18,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:12:18,070 INFO L225 Difference]: With dead ends: 3766 [2021-08-21 17:12:18,070 INFO L226 Difference]: Without dead ends: 2770 [2021-08-21 17:12:18,071 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 448.7ms TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2021-08-21 17:12:18,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2021-08-21 17:12:18,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2379. [2021-08-21 17:12:18,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2379 states, 2349 states have (on average 2.3886760323541933) internal successors, (5611), 2378 states have internal predecessors, (5611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:18,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 5611 transitions. [2021-08-21 17:12:18,118 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 5611 transitions. Word has length 76 [2021-08-21 17:12:18,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:12:18,119 INFO L470 AbstractCegarLoop]: Abstraction has 2379 states and 5611 transitions. [2021-08-21 17:12:18,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:18,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 5611 transitions. [2021-08-21 17:12:18,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-21 17:12:18,123 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:12:18,124 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:12:18,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-21 17:12:18,124 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:12:18,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:12:18,124 INFO L82 PathProgramCache]: Analyzing trace with hash 586481647, now seen corresponding path program 1 times [2021-08-21 17:12:18,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:12:18,125 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526877835] [2021-08-21 17:12:18,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:12:18,125 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:12:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:12:18,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:12:18,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:12:18,657 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526877835] [2021-08-21 17:12:18,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526877835] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:12:18,657 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:12:18,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-21 17:12:18,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904408148] [2021-08-21 17:12:18,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-21 17:12:18,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:12:18,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-21 17:12:18,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-08-21 17:12:18,658 INFO L87 Difference]: Start difference. First operand 2379 states and 5611 transitions. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:19,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:12:19,067 INFO L93 Difference]: Finished difference Result 3310 states and 7835 transitions. [2021-08-21 17:12:19,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-21 17:12:19,068 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-08-21 17:12:19,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:12:19,076 INFO L225 Difference]: With dead ends: 3310 [2021-08-21 17:12:19,076 INFO L226 Difference]: Without dead ends: 2852 [2021-08-21 17:12:19,076 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 252.8ms TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2021-08-21 17:12:19,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2021-08-21 17:12:19,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2348. [2021-08-21 17:12:19,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2348 states, 2318 states have (on average 2.4029335634167386) internal successors, (5570), 2347 states have internal predecessors, (5570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:19,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 2348 states and 5570 transitions. [2021-08-21 17:12:19,125 INFO L78 Accepts]: Start accepts. Automaton has 2348 states and 5570 transitions. Word has length 76 [2021-08-21 17:12:19,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:12:19,125 INFO L470 AbstractCegarLoop]: Abstraction has 2348 states and 5570 transitions. [2021-08-21 17:12:19,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:19,125 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 5570 transitions. [2021-08-21 17:12:19,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-21 17:12:19,130 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:12:19,130 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:12:19,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-21 17:12:19,131 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:12:19,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:12:19,131 INFO L82 PathProgramCache]: Analyzing trace with hash 2076386791, now seen corresponding path program 2 times [2021-08-21 17:12:19,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:12:19,131 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268703878] [2021-08-21 17:12:19,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:12:19,131 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:12:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:12:19,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:12:19,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:12:19,424 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268703878] [2021-08-21 17:12:19,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268703878] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:12:19,424 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:12:19,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-21 17:12:19,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582616047] [2021-08-21 17:12:19,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-21 17:12:19,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:12:19,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-21 17:12:19,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-08-21 17:12:19,425 INFO L87 Difference]: Start difference. First operand 2348 states and 5570 transitions. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:19,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:12:19,872 INFO L93 Difference]: Finished difference Result 3218 states and 7923 transitions. [2021-08-21 17:12:19,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-21 17:12:19,873 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-08-21 17:12:19,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:12:19,879 INFO L225 Difference]: With dead ends: 3218 [2021-08-21 17:12:19,879 INFO L226 Difference]: Without dead ends: 2304 [2021-08-21 17:12:19,880 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 266.4ms TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2021-08-21 17:12:19,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2021-08-21 17:12:19,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 2296. [2021-08-21 17:12:19,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2296 states, 2266 states have (on average 2.375551632833186) internal successors, (5383), 2295 states have internal predecessors, (5383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2296 states to 2296 states and 5383 transitions. [2021-08-21 17:12:19,922 INFO L78 Accepts]: Start accepts. Automaton has 2296 states and 5383 transitions. Word has length 76 [2021-08-21 17:12:19,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:12:19,923 INFO L470 AbstractCegarLoop]: Abstraction has 2296 states and 5383 transitions. [2021-08-21 17:12:19,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 12 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:19,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 5383 transitions. [2021-08-21 17:12:19,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-21 17:12:19,927 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:12:19,927 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:12:19,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-21 17:12:19,927 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:12:19,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:12:19,928 INFO L82 PathProgramCache]: Analyzing trace with hash 2058248005, now seen corresponding path program 3 times [2021-08-21 17:12:19,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:12:19,928 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473383091] [2021-08-21 17:12:19,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:12:19,928 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:12:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:12:20,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:12:20,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:12:20,368 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473383091] [2021-08-21 17:12:20,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473383091] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:12:20,368 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:12:20,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-21 17:12:20,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392037924] [2021-08-21 17:12:20,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-21 17:12:20,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:12:20,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-21 17:12:20,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-08-21 17:12:20,369 INFO L87 Difference]: Start difference. First operand 2296 states and 5383 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:20,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:12:20,964 INFO L93 Difference]: Finished difference Result 3220 states and 8026 transitions. [2021-08-21 17:12:20,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-21 17:12:20,965 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-08-21 17:12:20,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:12:20,969 INFO L225 Difference]: With dead ends: 3220 [2021-08-21 17:12:20,969 INFO L226 Difference]: Without dead ends: 2031 [2021-08-21 17:12:20,970 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 415.7ms TimeCoverageRelationStatistics Valid=160, Invalid=346, Unknown=0, NotChecked=0, Total=506 [2021-08-21 17:12:20,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states. [2021-08-21 17:12:20,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 2008. [2021-08-21 17:12:21,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2008 states, 1978 states have (on average 2.4201213346814963) internal successors, (4787), 2007 states have internal predecessors, (4787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:21,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 2008 states and 4787 transitions. [2021-08-21 17:12:21,005 INFO L78 Accepts]: Start accepts. Automaton has 2008 states and 4787 transitions. Word has length 76 [2021-08-21 17:12:21,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:12:21,006 INFO L470 AbstractCegarLoop]: Abstraction has 2008 states and 4787 transitions. [2021-08-21 17:12:21,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:21,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 4787 transitions. [2021-08-21 17:12:21,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-21 17:12:21,010 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:12:21,010 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:12:21,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-21 17:12:21,010 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:12:21,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:12:21,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1458972059, now seen corresponding path program 2 times [2021-08-21 17:12:21,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:12:21,011 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134844171] [2021-08-21 17:12:21,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:12:21,011 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:12:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:12:21,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:12:21,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:12:21,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134844171] [2021-08-21 17:12:21,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134844171] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:12:21,589 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:12:21,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-08-21 17:12:21,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706027272] [2021-08-21 17:12:21,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-08-21 17:12:21,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:12:21,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-21 17:12:21,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-08-21 17:12:21,590 INFO L87 Difference]: Start difference. First operand 2008 states and 4787 transitions. Second operand has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:22,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:12:22,019 INFO L93 Difference]: Finished difference Result 2448 states and 5967 transitions. [2021-08-21 17:12:22,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-21 17:12:22,020 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-08-21 17:12:22,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:12:22,023 INFO L225 Difference]: With dead ends: 2448 [2021-08-21 17:12:22,024 INFO L226 Difference]: Without dead ends: 2050 [2021-08-21 17:12:22,024 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 349.1ms TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2021-08-21 17:12:22,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2021-08-21 17:12:22,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 1891. [2021-08-21 17:12:22,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1891 states, 1863 states have (on average 2.435319377348363) internal successors, (4537), 1890 states have internal predecessors, (4537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:22,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 4537 transitions. [2021-08-21 17:12:22,059 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 4537 transitions. Word has length 76 [2021-08-21 17:12:22,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:12:22,060 INFO L470 AbstractCegarLoop]: Abstraction has 1891 states and 4537 transitions. [2021-08-21 17:12:22,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:22,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 4537 transitions. [2021-08-21 17:12:22,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-21 17:12:22,063 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:12:22,064 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:12:22,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-21 17:12:22,064 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:12:22,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:12:22,064 INFO L82 PathProgramCache]: Analyzing trace with hash 30933085, now seen corresponding path program 4 times [2021-08-21 17:12:22,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:12:22,065 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610207654] [2021-08-21 17:12:22,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:12:22,065 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:12:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:12:22,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:12:22,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:12:22,589 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610207654] [2021-08-21 17:12:22,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610207654] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:12:22,589 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:12:22,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-08-21 17:12:22,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758771902] [2021-08-21 17:12:22,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-08-21 17:12:22,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:12:22,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-08-21 17:12:22,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2021-08-21 17:12:22,590 INFO L87 Difference]: Start difference. First operand 1891 states and 4537 transitions. Second operand has 17 states, 17 states have (on average 4.470588235294118) internal successors, (76), 17 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:23,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:12:23,339 INFO L93 Difference]: Finished difference Result 2935 states and 7248 transitions. [2021-08-21 17:12:23,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-21 17:12:23,340 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.470588235294118) internal successors, (76), 17 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-08-21 17:12:23,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:12:23,343 INFO L225 Difference]: With dead ends: 2935 [2021-08-21 17:12:23,343 INFO L226 Difference]: Without dead ends: 1741 [2021-08-21 17:12:23,343 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 503.9ms TimeCoverageRelationStatistics Valid=207, Invalid=549, Unknown=0, NotChecked=0, Total=756 [2021-08-21 17:12:23,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1741 states. [2021-08-21 17:12:23,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1741 to 1662. [2021-08-21 17:12:23,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 1634 states have (on average 2.4216646266829867) internal successors, (3957), 1661 states have internal predecessors, (3957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:23,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 3957 transitions. [2021-08-21 17:12:23,369 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 3957 transitions. Word has length 76 [2021-08-21 17:12:23,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:12:23,369 INFO L470 AbstractCegarLoop]: Abstraction has 1662 states and 3957 transitions. [2021-08-21 17:12:23,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.470588235294118) internal successors, (76), 17 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:23,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 3957 transitions. [2021-08-21 17:12:23,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-21 17:12:23,374 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:12:23,374 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:12:23,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-21 17:12:23,374 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:12:23,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:12:23,375 INFO L82 PathProgramCache]: Analyzing trace with hash -237169271, now seen corresponding path program 1 times [2021-08-21 17:12:23,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:12:23,375 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019202820] [2021-08-21 17:12:23,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:12:23,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:12:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:12:23,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:12:23,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:12:23,492 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019202820] [2021-08-21 17:12:23,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019202820] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:12:23,492 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:12:23,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 17:12:23,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316628147] [2021-08-21 17:12:23,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 17:12:23,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:12:23,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 17:12:23,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 17:12:23,494 INFO L87 Difference]: Start difference. First operand 1662 states and 3957 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:23,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:12:23,631 INFO L93 Difference]: Finished difference Result 1911 states and 4438 transitions. [2021-08-21 17:12:23,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 17:12:23,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2021-08-21 17:12:23,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:12:23,634 INFO L225 Difference]: With dead ends: 1911 [2021-08-21 17:12:23,634 INFO L226 Difference]: Without dead ends: 1287 [2021-08-21 17:12:23,634 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 106.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 17:12:23,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2021-08-21 17:12:23,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1287. [2021-08-21 17:12:23,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1259 states have (on average 2.4980142970611596) internal successors, (3145), 1286 states have internal predecessors, (3145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:23,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 3145 transitions. [2021-08-21 17:12:23,656 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 3145 transitions. Word has length 77 [2021-08-21 17:12:23,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:12:23,657 INFO L470 AbstractCegarLoop]: Abstraction has 1287 states and 3145 transitions. [2021-08-21 17:12:23,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:23,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 3145 transitions. [2021-08-21 17:12:23,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-08-21 17:12:23,659 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:12:23,660 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:12:23,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-21 17:12:23,660 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:12:23,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:12:23,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1333879825, now seen corresponding path program 1 times [2021-08-21 17:12:23,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:12:23,660 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498054311] [2021-08-21 17:12:23,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:12:23,661 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:12:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:12:23,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:12:23,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:12:23,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498054311] [2021-08-21 17:12:23,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498054311] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:12:23,796 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:12:23,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-21 17:12:23,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323331182] [2021-08-21 17:12:23,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-21 17:12:23,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:12:23,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-21 17:12:23,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-21 17:12:23,798 INFO L87 Difference]: Start difference. First operand 1287 states and 3145 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:23,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:12:23,962 INFO L93 Difference]: Finished difference Result 1181 states and 2646 transitions. [2021-08-21 17:12:23,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-21 17:12:23,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2021-08-21 17:12:23,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:12:23,964 INFO L225 Difference]: With dead ends: 1181 [2021-08-21 17:12:23,964 INFO L226 Difference]: Without dead ends: 768 [2021-08-21 17:12:23,964 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 136.3ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-21 17:12:23,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2021-08-21 17:12:23,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 768. [2021-08-21 17:12:23,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 744 states have (on average 2.3198924731182795) internal successors, (1726), 767 states have internal predecessors, (1726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:23,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1726 transitions. [2021-08-21 17:12:23,975 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1726 transitions. Word has length 78 [2021-08-21 17:12:23,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:12:23,976 INFO L470 AbstractCegarLoop]: Abstraction has 768 states and 1726 transitions. [2021-08-21 17:12:23,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:23,976 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1726 transitions. [2021-08-21 17:12:23,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-08-21 17:12:23,977 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:12:23,977 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:12:23,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-21 17:12:23,978 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:12:23,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:12:23,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1352568294, now seen corresponding path program 1 times [2021-08-21 17:12:23,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:12:23,978 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504524519] [2021-08-21 17:12:23,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:12:23,978 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:12:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:12:24,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:12:24,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:12:24,241 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504524519] [2021-08-21 17:12:24,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504524519] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:12:24,241 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:12:24,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-21 17:12:24,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704725387] [2021-08-21 17:12:24,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-21 17:12:24,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:12:24,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-21 17:12:24,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-21 17:12:24,243 INFO L87 Difference]: Start difference. First operand 768 states and 1726 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:24,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:12:24,580 INFO L93 Difference]: Finished difference Result 1309 states and 3106 transitions. [2021-08-21 17:12:24,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-21 17:12:24,581 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2021-08-21 17:12:24,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:12:24,583 INFO L225 Difference]: With dead ends: 1309 [2021-08-21 17:12:24,583 INFO L226 Difference]: Without dead ends: 862 [2021-08-21 17:12:24,583 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 238.6ms TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2021-08-21 17:12:24,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2021-08-21 17:12:24,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 713. [2021-08-21 17:12:24,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 695 states have (on average 2.423021582733813) internal successors, (1684), 712 states have internal predecessors, (1684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:24,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1684 transitions. [2021-08-21 17:12:24,594 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1684 transitions. Word has length 79 [2021-08-21 17:12:24,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:12:24,595 INFO L470 AbstractCegarLoop]: Abstraction has 713 states and 1684 transitions. [2021-08-21 17:12:24,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:24,595 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1684 transitions. [2021-08-21 17:12:24,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-21 17:12:24,596 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:12:24,596 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:12:24,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-21 17:12:24,597 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:12:24,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:12:24,597 INFO L82 PathProgramCache]: Analyzing trace with hash 774867504, now seen corresponding path program 1 times [2021-08-21 17:12:24,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:12:24,597 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210110286] [2021-08-21 17:12:24,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:12:24,597 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:12:24,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:12:24,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:12:24,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:12:24,744 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210110286] [2021-08-21 17:12:24,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210110286] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:12:24,744 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:12:24,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-21 17:12:24,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521657180] [2021-08-21 17:12:24,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-21 17:12:24,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:12:24,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-21 17:12:24,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-21 17:12:24,746 INFO L87 Difference]: Start difference. First operand 713 states and 1684 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:24,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:12:24,921 INFO L93 Difference]: Finished difference Result 491 states and 1014 transitions. [2021-08-21 17:12:24,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-21 17:12:24,922 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-08-21 17:12:24,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:12:24,922 INFO L225 Difference]: With dead ends: 491 [2021-08-21 17:12:24,922 INFO L226 Difference]: Without dead ends: 295 [2021-08-21 17:12:24,923 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 148.9ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-08-21 17:12:24,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2021-08-21 17:12:24,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 283. [2021-08-21 17:12:24,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 274 states have (on average 1.8065693430656935) internal successors, (495), 282 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:24,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 495 transitions. [2021-08-21 17:12:24,925 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 495 transitions. Word has length 80 [2021-08-21 17:12:24,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:12:24,926 INFO L470 AbstractCegarLoop]: Abstraction has 283 states and 495 transitions. [2021-08-21 17:12:24,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:24,926 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 495 transitions. [2021-08-21 17:12:24,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-21 17:12:24,926 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:12:24,927 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:12:24,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-21 17:12:24,927 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:12:24,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:12:24,927 INFO L82 PathProgramCache]: Analyzing trace with hash -492791917, now seen corresponding path program 1 times [2021-08-21 17:12:24,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:12:24,927 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605421460] [2021-08-21 17:12:24,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:12:24,927 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:12:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:12:25,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:12:25,572 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:12:25,572 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605421460] [2021-08-21 17:12:25,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605421460] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:12:25,572 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:12:25,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-21 17:12:25,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610468273] [2021-08-21 17:12:25,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-08-21 17:12:25,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:12:25,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-21 17:12:25,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-08-21 17:12:25,574 INFO L87 Difference]: Start difference. First operand 283 states and 495 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:26,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:12:26,153 INFO L93 Difference]: Finished difference Result 430 states and 810 transitions. [2021-08-21 17:12:26,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-21 17:12:26,154 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-08-21 17:12:26,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:12:26,154 INFO L225 Difference]: With dead ends: 430 [2021-08-21 17:12:26,155 INFO L226 Difference]: Without dead ends: 289 [2021-08-21 17:12:26,155 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 510.0ms TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2021-08-21 17:12:26,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-08-21 17:12:26,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 273. [2021-08-21 17:12:26,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 264 states have (on average 1.7992424242424243) internal successors, (475), 272 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:26,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 475 transitions. [2021-08-21 17:12:26,158 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 475 transitions. Word has length 82 [2021-08-21 17:12:26,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:12:26,159 INFO L470 AbstractCegarLoop]: Abstraction has 273 states and 475 transitions. [2021-08-21 17:12:26,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:26,159 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 475 transitions. [2021-08-21 17:12:26,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-21 17:12:26,160 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:12:26,160 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:12:26,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-21 17:12:26,160 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:12:26,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:12:26,160 INFO L82 PathProgramCache]: Analyzing trace with hash 821859055, now seen corresponding path program 2 times [2021-08-21 17:12:26,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:12:26,161 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404198241] [2021-08-21 17:12:26,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:12:26,161 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:12:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:12:26,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-21 17:12:26,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:12:26,490 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404198241] [2021-08-21 17:12:26,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404198241] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:12:26,490 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:12:26,490 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-21 17:12:26,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727528655] [2021-08-21 17:12:26,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-21 17:12:26,491 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:12:26,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-21 17:12:26,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-08-21 17:12:26,492 INFO L87 Difference]: Start difference. First operand 273 states and 475 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:26,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:12:26,748 INFO L93 Difference]: Finished difference Result 420 states and 790 transitions. [2021-08-21 17:12:26,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-21 17:12:26,749 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-08-21 17:12:26,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:12:26,749 INFO L225 Difference]: With dead ends: 420 [2021-08-21 17:12:26,749 INFO L226 Difference]: Without dead ends: 263 [2021-08-21 17:12:26,750 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 170.4ms TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2021-08-21 17:12:26,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2021-08-21 17:12:26,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2021-08-21 17:12:26,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 254 states have (on average 1.81496062992126) internal successors, (461), 262 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:26,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 461 transitions. [2021-08-21 17:12:26,753 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 461 transitions. Word has length 82 [2021-08-21 17:12:26,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:12:26,753 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 461 transitions. [2021-08-21 17:12:26,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-21 17:12:26,754 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 461 transitions. [2021-08-21 17:12:26,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-08-21 17:12:26,754 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:12:26,755 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:12:26,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-21 17:12:26,755 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:12:26,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:12:26,755 INFO L82 PathProgramCache]: Analyzing trace with hash -589990477, now seen corresponding path program 3 times [2021-08-21 17:12:26,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:12:26,755 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129827598] [2021-08-21 17:12:26,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:12:26,756 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:12:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-21 17:12:26,798 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-21 17:12:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-21 17:12:26,890 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-21 17:12:26,890 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-21 17:12:26,891 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 17:12:26,893 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 17:12:26,893 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-21 17:12:26,893 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-21 17:12:26,894 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-08-21 17:12:26,894 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 17:12:26,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-21 17:12:26,899 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-21 17:12:26,900 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-21 17:12:27,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 05:12:27 BasicIcfg [2021-08-21 17:12:27,061 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-21 17:12:27,062 INFO L168 Benchmark]: Toolchain (without parser) took 25975.32 ms. Allocated memory was 180.4 MB in the beginning and 833.6 MB in the end (delta: 653.3 MB). Free memory was 143.7 MB in the beginning and 347.4 MB in the end (delta: -203.7 MB). Peak memory consumption was 450.2 MB. Max. memory is 8.0 GB. [2021-08-21 17:12:27,063 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 180.4 MB. Free memory was 162.3 MB in the beginning and 162.1 MB in the end (delta: 132.5 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-08-21 17:12:27,063 INFO L168 Benchmark]: CACSL2BoogieTranslator took 746.92 ms. Allocated memory is still 180.4 MB. Free memory was 143.4 MB in the beginning and 147.0 MB in the end (delta: -3.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-08-21 17:12:27,063 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.88 ms. Allocated memory is still 180.4 MB. Free memory was 147.0 MB in the beginning and 143.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-21 17:12:27,064 INFO L168 Benchmark]: Boogie Preprocessor took 34.56 ms. Allocated memory is still 180.4 MB. Free memory was 143.9 MB in the beginning and 141.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-21 17:12:27,064 INFO L168 Benchmark]: RCFGBuilder took 3905.25 ms. Allocated memory was 180.4 MB in the beginning and 246.4 MB in the end (delta: 66.1 MB). Free memory was 141.3 MB in the beginning and 216.5 MB in the end (delta: -75.2 MB). Peak memory consumption was 131.3 MB. Max. memory is 8.0 GB. [2021-08-21 17:12:27,064 INFO L168 Benchmark]: TraceAbstraction took 21195.92 ms. Allocated memory was 246.4 MB in the beginning and 833.6 MB in the end (delta: 587.2 MB). Free memory was 216.0 MB in the beginning and 347.4 MB in the end (delta: -131.4 MB). Peak memory consumption was 455.8 MB. Max. memory is 8.0 GB. [2021-08-21 17:12:27,066 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.19 ms. Allocated memory is still 180.4 MB. Free memory was 162.3 MB in the beginning and 162.1 MB in the end (delta: 132.5 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 746.92 ms. Allocated memory is still 180.4 MB. Free memory was 143.4 MB in the beginning and 147.0 MB in the end (delta: -3.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 65.88 ms. Allocated memory is still 180.4 MB. Free memory was 147.0 MB in the beginning and 143.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 34.56 ms. Allocated memory is still 180.4 MB. Free memory was 143.9 MB in the beginning and 141.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 3905.25 ms. Allocated memory was 180.4 MB in the beginning and 246.4 MB in the end (delta: 66.1 MB). Free memory was 141.3 MB in the beginning and 216.5 MB in the end (delta: -75.2 MB). Peak memory consumption was 131.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 21195.92 ms. Allocated memory was 246.4 MB in the beginning and 833.6 MB in the end (delta: 587.2 MB). Free memory was 216.0 MB in the beginning and 347.4 MB in the end (delta: -131.4 MB). Peak memory consumption was 455.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 46222, positive: 41781, positive conditional: 41781, positive unconditional: 0, negative: 4441, negative conditional: 4441, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 45366, positive: 41781, positive conditional: 0, positive unconditional: 41781, negative: 3585, negative conditional: 0, negative unconditional: 3585, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1077, positive: 1026, positive conditional: 0, positive unconditional: 1026, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1077, positive: 1023, positive conditional: 0, positive unconditional: 1023, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 54, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 928, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 921, negative conditional: 0, negative unconditional: 921, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 45366, positive: 40755, positive conditional: 0, positive unconditional: 40755, negative: 3534, negative conditional: 0, negative unconditional: 3534, unknown: 1077, unknown conditional: 0, unknown unconditional: 1077] , Statistics on independence cache: Total cache size (in pairs): 1077, Positive cache size: 1026, Positive conditional cache size: 0, Positive unconditional cache size: 1026, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Independence queries for same thread: 856 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L720] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L721] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L722] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L723] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L724] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L725] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L726] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L727] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L728] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L729] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L730] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L731] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L732] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L733] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L734] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L736] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L737] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L738] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L849] 0 pthread_t t2552; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L850] FCALL, FORK 0 pthread_create(&t2552, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2553; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L852] FCALL, FORK 0 pthread_create(&t2553, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2554; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L854] FCALL, FORK 0 pthread_create(&t2554, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 3 !(!expression) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] 2 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 20855.6ms, OverallIterations: 22, TraceHistogramMax: 1, EmptinessCheckTime: 204.0ms, AutomataDifference: 9381.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2004.3ms, PartialOrderReductionTime: 1984.9ms, HoareTripleCheckerStatistics: 2571 SDtfs, 4186 SDslu, 11834 SDs, 0 SdLazy, 2752 SolverSat, 652 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3885.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 369 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 316 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 6085.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=11680occurred in iteration=0, InterpolantAutomatonStates: 261, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1215.4ms AutomataMinimizationTime, 21 MinimizatonAttempts, 2591 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 84.6ms SsaConstructionTime, 967.0ms SatisfiabilityAnalysisTime, 6591.8ms InterpolantComputationTime, 1652 NumberOfCodeBlocks, 1652 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1549 ConstructedInterpolants, 0 QuantifiedInterpolants, 10262 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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! [2021-08-21 17:12:27,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...